#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii; 
typedef vector<ii> vii; 
typedef vector<int> vi;
typedef priority_queue<int, std::vector<int>, std::greater<int> >  rpq;
#define pb push_back
#define ll long long
#define F first
#define S second
#define eps 1e-9
#define M (ll)(1e9+7)
#define pi 3.14159265358979323846
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

int main()
{
    ios;
    ll t;
    cin>>t;
    while(t--){
        ll n;
        cin>>n;
        n+=2;
        ll a[n];
        for(int i=0;i<n;i++)
            cin>>a[i];
        sort(a, a+n);
        ll val=a[n-1];
        ll ans=-1, extra=-1;
        ll sum=0;
        for(int i=0;i<n-1;i++){
            sum+=a[i];
        }

        for(int i=0;i<n-1;i++){
            if(sum-a[i]==val){
                ans=val;
                extra=i;
            }
        }

        if(ans!=-1){
            for(int i=0;i<n-1;i++){
                if(i==extra)
                    continue;
                cout<<a[i]<<" ";
                
            }
            cout<<endl;
            continue;
        }

        extra=a[n-1];
        val=a[n-2];
        sum=0;
        for(int i=0;i<n-2;i++){
            sum+=a[i];
        }
        if(sum==val){
            ans=val;
        }

        if(ans==-1){
            cout<<ans<<endl;
        }else{
            for(int i=0;i<n-2;i++)
                cout<<a[i]<<" ";
            cout<<endl;
        }
    }
}