#include <bits/stdc++.h>

using namespace std;
#define fast  ios_base::sync_with_stdio(false);  cin.tie(nullptr), cout.tie(nullptr)
#define FIO  freopen("input.txt","r",stdin);  freopen("output.txt","w",stdout);
#define gcd __gcd
#define pi acos(-1)
#define sp " "
#define LL long long
#define mod (long long)(1000000000 + 7)
#define SET(n) fixed << setprecision(n)
int ioo = INT_MAX;
LL Loo = LONG_LONG_MAX;

LL power(LL fa, LL n)
{
    LL k = 1;
    while(n)
    {
        if(n % 2) k = (k * fa) % mod;
        fa = (fa * fa) % mod;
        n /= 2;
    }
    return k;
}

int n;
LL a[200005];

int main() {
    fast;

    int q; cin >> q;
    while(q--)
    {
        cin >> n;
        LL sum = 0;
        for(int i = 1;i <= n+2; i++)
        {
            cin >> a[i];
            sum += a[i];
        }
        sort(a + 1 , a + n + 3);

        int x = -1 , n1 = -1;
        for(int i = 1;i <= n+1; i++)
        {
            if((sum - a[i]) - a[n+2] == a[n+2])
            {
                x = i;
                n1 = n+2;
                break;
            }
        }
        if((sum - a[n+2]) - a[n+1] == a[n+1]) x = n+2 , n1 = n+1;

        if(x == -1) cout << -1 << endl;
        else
        {
            for(int i = 1;i <= n+2; i++) if(i != x && i != n1) cout << a[i] << sp;
            cout << endl;
        }
    }
    return 0;
}