#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long int LL;
typedef vector<int> VI;

#define sd(x) scanf("%d", &x)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define INF 2000000000
#define MOD 1000000007
#define D double
#define LD long double

#define N 1123
#define M 1123456

int pairsums[M];
int a[N];

inline void solve(){
    int n, i, j;
    LL ans = 0;
    sd(n);
    for(i = 0; i < n; i++){
        sd(a[i]);
    }
    sort(a, a + n);
    int m = 0;
    for(i = 0; i < n; ++i){
        for(j = i + 1; j < n; ++j){
            pairsums[m] = (a[i] + a[j]);
            m++;
        }
    }
    sort(pairsums, pairsums + m);
    LL tot = 0, p;
    for(i = 0; i < m; i++){
        p = (i + i - m + 1);
        p += p;
        ans += p * pairsums[i];
    }
    for(i = 0; i < n; ++i){
        tot = 0;
        for(j = n - 1; j > i + 1; --j){
            tot += abs(a[j] - a[i]);
            ans -= (tot * 4);
        }
    }
    cout<<ans<<endl;
}

int main(){
    int t;
    sd(t);
    while(t--){
        solve();
    }
	return 0;
}