#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <map>
using namespace std;

typedef long long ll;
const double pi=acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll mod=1000000007;
const int maxn=50050;
const ll N=11;
const double pai=3.14159265358979;
const ll maxn2=1e3+2;
#define mem(a,b) memset(a,b,sizeof(a))
const int MAXN=3e7;
ll s[100007],a[100007];
ll t,n,m,ans,num,sum,p;
int main()
{
    cin>>t;
    while(t--)
    {
        memset(s,0,sizeof(s));
        cin>>n;
        ans=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%lld",&a[i]);

        }
        sort(a+1,a+1+n);
        for(int i=1;i<n;i++)
        {
            s[i]=a[i+1]-a[i];
            ans+=s[i]*(n-i)*i;
        }
        cout<<ans<<endl;
    }
}