#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <set>
#include <algorithm>
 
using namespace std;
 
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define loopi(n) for (int i = 0; i < n; i++)
#define loopj(n) for (int j = 0; j < n; j++)
#define loopi1(n) for (int i = 1; i <= n; i++)
#define loopj1(n) for (int j = 1; j <= n; j++)
#define pb push_back
#define eb emplace_back
#define graphinsertcheck(a, b) cout << "inserted: " << a << " to " << b << "\n"
#define graphinsertweightcheck(a, b, c) cout << "inserted: " << a << " to " << b << " weight: " << c << "\n"
 
 
typedef long long ll;
typedef vector<vector<ll> > vvll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
 
ll t, n, s;
const ll INF = 1e9+7;
 
int main() {
    cin >> t;
    loopi(t) {
        cin >> n;
        vll set(n);
        loopj(n) cin >> set[j];
        sort(set.begin(), set.end()); // sort in ascending order
        ll sum = 0;
        for (int j = 1; j < n; j++) sum += set[j] * ((1LL << j) - 1); // sum contributions of 2nd biggest -> largest 1LL << i is the number of times its the largest in subset
        loopj(n-1) sum -= set[j] * ((1LL << (n - j - 1)) - 1); // subtract from smallest to 2nd biggest 1LL << n - i - 1 is # of times its the smallest in subset
        sum = sum % INF;
        cout << sum << "\n";
    }
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8cXVldWU+CiNpbmNsdWRlIDxzdHJpbmc+CiNpbmNsdWRlIDxzZXQ+CiNpbmNsdWRlIDxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKI2RlZmluZSBOTyBjb3V0IDw8ICJOT1xuIjsKI2RlZmluZSBZRVMgY291dCA8PCAiWUVTXG4iOwojZGVmaW5lIGxvb3BpKG4pIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQojZGVmaW5lIGxvb3BqKG4pIGZvciAoaW50IGogPSAwOyBqIDwgbjsgaisrKQojZGVmaW5lIGxvb3BpMShuKSBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspCiNkZWZpbmUgbG9vcGoxKG4pIGZvciAoaW50IGogPSAxOyBqIDw9IG47IGorKykKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBlYiBlbXBsYWNlX2JhY2sKI2RlZmluZSBncmFwaGluc2VydGNoZWNrKGEsIGIpIGNvdXQgPDwgImluc2VydGVkOiAiIDw8IGEgPDwgIiB0byAiIDw8IGIgPDwgIlxuIgojZGVmaW5lIGdyYXBoaW5zZXJ0d2VpZ2h0Y2hlY2soYSwgYiwgYykgY291dCA8PCAiaW5zZXJ0ZWQ6ICIgPDwgYSA8PCAiIHRvICIgPDwgYiA8PCAiIHdlaWdodDogIiA8PCBjIDw8ICJcbiIKCgp0eXBlZGVmIGxvbmcgbG9uZyBsbDsKdHlwZWRlZiB2ZWN0b3I8dmVjdG9yPGxsPiA+IHZ2bGw7CnR5cGVkZWYgdmVjdG9yPGxsPiB2bGw7CnR5cGVkZWYgcGFpcjxsbCwgbGw+IHBsbDsKCmxsIHQsIG4sIHM7CmNvbnN0IGxsIElORiA9IDFlOSs3OwoKaW50IG1haW4oKSB7CiAgICBjaW4gPj4gdDsKICAgIGxvb3BpKHQpIHsKICAgICAgICBjaW4gPj4gbjsKICAgICAgICB2bGwgc2V0KG4pOwogICAgICAgIGxvb3BqKG4pIGNpbiA+PiBzZXRbal07CiAgICAgICAgc29ydChzZXQuYmVnaW4oKSwgc2V0LmVuZCgpKTsgLy8gc29ydCBpbiBhc2NlbmRpbmcgb3JkZXIKICAgICAgICBsbCBzdW0gPSAwOwogICAgICAgIGZvciAoaW50IGogPSAxOyBqIDwgbjsgaisrKSBzdW0gKz0gc2V0W2pdICogKCgxTEwgPDwgaikgLSAxKTsgLy8gc3VtIGNvbnRyaWJ1dGlvbnMgb2YgMm5kIGJpZ2dlc3QgLT4gbGFyZ2VzdCAxTEwgPDwgaSBpcyB0aGUgbnVtYmVyIG9mIHRpbWVzIGl0cyB0aGUgbGFyZ2VzdCBpbiBzdWJzZXQKICAgICAgICBsb29waihuLTEpIHN1bSAtPSBzZXRbal0gKiAoKDFMTCA8PCAobiAtIGogLSAxKSkgLSAxKTsgLy8gc3VidHJhY3QgZnJvbSBzbWFsbGVzdCB0byAybmQgYmlnZ2VzdCAxTEwgPDwgbiAtIGkgLSAxIGlzICMgb2YgdGltZXMgaXRzIHRoZSBzbWFsbGVzdCBpbiBzdWJzZXQKICAgICAgICBzdW0gPSBzdW0gJSBJTkY7CiAgICAgICAgY291dCA8PCBzdW0gPDwgIlxuIjsKICAgIH0KfQo=

ClNldCBEaWZmZXJlbmNlICBBZGQgcHJvYmxlbSB0byBUb2RvIGxpc3QKUHJvYmxlbSBjb2RlOiBTRVRESUZGICAJClNVQk1JVE1ZIFNVQk1JU1NJT05TQUxMIFNVQk1JU1NJT05TClJlYWQgcHJvYmxlbXMgc3RhdGVtZW50cyBpbiBNYW5kYXJpbiBDaGluZXNlIGFuZCBSdXNzaWFuLgoKQ2h1cnUgaXMgd29ya2luZyBhcyBhIGRhdGEgc2NpZW50aXN0IGluIENvZGVycHVyLiBIZSB3b3JrcyBvbiBhIGxvdCBvZiBkYXRhIG9uIHRoZSBkYWlseSBiYXNpcy4gT25lIGRheSwgaGUgZm91bmQgYW4gaW50ZXJlc3RpbmcgcHJvYmxlbSwgd2hpY2ggd2FzIHZlcnkgZWFzeSB0byBzb2x2ZSBmb3Igc21hbGwgZGF0YSBidXQgd2FzIGdldHRpbmcgbW9yZSBjb21wbGV4IHdpdGggaW5jcmVhc2luZyBudW1iZXIgb2YgZGF0YSBwb2ludHMuIFNvLCBDaHVydSBuZWVkcyB5b3VyIGhlbHAgaW4gc29sdmluZyB0aGlzIHByb2JsZW0uCkdpdmVuIGEgc2V0IFMgb2YgTiBub24tbmVnYXRpdmUgaW50ZWdlcnMgKFNvbWUgaW50ZWdlcnMgbWlnaHQgb2NjdXIgbW9yZSB0aGFuIG9uY2UgaW4gdGhlIHNldCksIGZpbmQgb3V0IHRoZSB2YWx1ZSBvZiBTRVRESUZGKFMpLgpNb3VudGFpbiBWaWV3CldoZXJlIG1heChzKSByZXByZXNlbnRzIHRoZSBtYXhpbXVtIHZhbHVlIGluIHNldCBzIHdoZXJlYXMgbWluKHMpIHJlcHJlc2VudHMgdGhlIG1pbmltdW0gdmFsdWUgaW4gdGhlIHNldCBzLgpBcyB2YWx1ZSBvZiBTRVRESUZGKFMpIGNhbiBiZSB2ZXJ5IGxhcmdlLCBwcmludCBpdCBtb2R1bG8gKDEwOSArIDcpIC4KSW5wdXQKCkZpcnN0IGxpbmUgb2YgaW5wdXQgY29udGFpbnMgYW4gaW50ZWdlciBUIGRlbm90aW5nIG51bWJlciBvZiB0ZXN0IGNhc2VzLgpGb3IgZWFjaCB0ZXN0IGNhc2UsIGZpcnN0IGxpbmUgd2lsbCBjb250YWluIGFuIGludGVnZXIgTiBkZW5vdGluZyBudW1iZXIgb2YgZWxlbWVudHMgaW4gc2V0IFMuCk5leHQgbGluZSBjb250YWlucyBOIHNwYWNlIHNlcGFyYXRlZCBpbnRlZ2VycyBkZW5vdGluZyB0aGUgc2V0IFMuCk91dHB1dAoKRm9yIGVhY2ggdGVzdCBjYXNlLCBwcmludCBhIHNpbmdsZSBpbnRlZ2VyIHJlcHJlc2VudGluZyB0aGUgYW5zd2VyIG9mIHRoYXQgdGVzdCBjYXNlLgpOb3RlCgpUd28gc3Vic2V0cyB3aWxsIGJlIGNhbGxlZCBkaWZmZXJlbnQgaWYgdGhlcmUgZXhpc3RzIGFuIGluZGV4IGkgc3VjaCB0aGF0IFNbaV0gaXMgb2NjdXJzIGluIG9uZSBvZiB0aGUgc3Vic2V0IGFuZCBub3QgaW4gYW5vdGhlci4KQ29uc3RyYWludHMKClN1YnRhc2sgIzE6IDIwIHBvaW50cwoxICZsZTsgVCAmbGU7IDUsIDEgJmxlOyBOICZsZTsgMTAwMCwgMCAmbGU7IHZhbHVlIGluIHNldCAmbGU7IDEwOQpTdWJ0YXNrICMyOiAyNSBwb2ludHMKMSAmbGU7IFQgJmxlOyA1LCAxICZsZTsgTiAmbGU7IDEwNSwgMCAmbGU7IHZhbHVlIGluIHNldCAmbGU7IDEwMDAKU3VidGFzayAjMzogNTUgcG9pbnRzCjEgJmxlOyBUICZsZTsgNSwgMSAmbGU7IE4gJmxlOyAxMDUsIDAgJmxlOyB2YWx1ZSBpbiBzZXQgJmxlOyAxMDkKRXhhbXBsZQoKSW5wdXQ6CjMKMgoxIDIKMwoxIDIgMwo0CjEgMiAzIDQ=

Set Difference  Add problem to Todo list
Problem code: SETDIFF  	
SUBMITMY SUBMISSIONSALL SUBMISSIONS
Read problems statements in Mandarin Chinese and Russian.

Churu is working as a data scientist in Coderpur. He works on a lot of data on the daily basis. One day, he found an interesting problem, which was very easy to solve for small data but was getting more complex with increasing number of data points. So, Churu needs your help in solving this problem.
Given a set S of N non-negative integers (Some integers might occur more than once in the set), find out the value of SETDIFF(S).
Mountain View
Where max(s) represents the maximum value in set s whereas min(s) represents the minimum value in the set s.
As value of SETDIFF(S) can be very large, print it modulo (109 + 7) .
Input

First line of input contains an integer T denoting number of test cases.
For each test case, first line will contain an integer N denoting number of elements in set S.
Next line contains N space separated integers denoting the set S.
Output

For each test case, print a single integer representing the answer of that test case.
Note

Two subsets will be called different if there exists an index i such that S[i] is occurs in one of the subset and not in another.
Constraints

Subtask #1: 20 points
1 ≤ T ≤ 5, 1 ≤ N ≤ 1000, 0 ≤ value in set ≤ 109
Subtask #2: 25 points
1 ≤ T ≤ 5, 1 ≤ N ≤ 105, 0 ≤ value in set ≤ 1000
Subtask #3: 55 points
1 ≤ T ≤ 5, 1 ≤ N ≤ 105, 0 ≤ value in set ≤ 109
Example

Input:
3
2
1 2
3
1 2 3
4
1 2 3 4