#include<bits/stdc++.h>
using namespace std;

#define FASTIO	ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long 
#define mset(A,val) memset(A,val,sizeof(A))
#define fi(a,b) for(int i=a;i<=b;++i)
#define fj(a,b) for(int j=a;j<=b;++j)
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define pii pair<int,int>
#define eb emplace_back
#define DEBUG(a...) cout<<#a<<": ";for(auto &it:a)cout<<it<<" ";cout<<"\n";
#define debug(a)cout<<#a<<": "<<a<<"\n";
#define int long long

// ---------------------------------------------------------------------------
const int mod = 1e9+7;
const int maxn = 2e5 + 9;

// ---------------------------------------------------------------------------
void init(){}

// ---------------------------------------------------------------------------
void test_case(int tc)
{
    // cout<<"Case #"<<tc<<": ";
    init();
    int n;cin>>n;
    n+=2;
    int totSum = 0;
    vi arr(n);fi(0,n-1)cin>>arr[i],totSum+=arr[i];
    sort(all(arr));
    // last element is sum of all 
    int sum = arr[n-1];
    int ans = -1;
    fi(0,n-2){
        if(totSum-sum-arr[i]==sum){
            ans = arr[i];
            fj(0,n-2){
                if(i!=j){
                    cout<<arr[j]<<" ";
                }
            }
            cout<<"\n";
            return;
        }
        
    }
    sum = arr[n-2];
    ans = -1;
    fi(0,n-1){
        if(i==n-2)continue;
        if(totSum-sum-arr[i]==sum){
            ans = arr[i];
            fj(0,n-1){
                if(i!=j && j!=n-2){
                    cout<<arr[j]<<" ";
                    
                }
            }
            cout<<"\n";
                return;
        }
        
    }
    cout<<"-1\n";
}

int32_t main()
{
    FASTIO;
    #ifndef ONLINE_JUDGE
         freopen("input.txt","r",stdin);
         // freopen("output.txt","w",stdout);
    #endif
    
    int t=1;
    cin>>t;
    for(int tc=1;tc<=t;++tc)test_case(tc);
}	