#include<bits/stdc++.h>
#define ll long long
#define FAST ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define vll vector<ll>
#define pb push_back
using namespace std;
#define INF LLONG_MAX
const ll  N =1e9+7;
ll moduloexp(ll x, ll y , ll m) // o(logy)  returns x^y%m
{
    
    if(y==0)
    {
        return 1;
    }
    if(y%2==0)
    {
        return (moduloexp(x,y/2,m)*(moduloexp(x,y/2,m)))%m;
    }
    else
    {
        return((x%m)*(moduloexp(x,y-1,m)))%m;
    }
    
}
int main()

{ 
	FAST;
	     int tc;cin>>tc;
	 	while(tc--)
	 	{
	        ll n;
	        cin>>n;
	        ll a[n+2];
	        ll b[n+2];
	        for(ll i=0;i<n+2;i++)
	        {
	            cin>>a[i];
	            b[i]=a[i];
	        }
	        sort(a,a+n+2);
	        ll sum=0;
	        for(ll i=0;i<n;i++)
	        {
	            sum+=a[i];
	        }
	        
	        if(sum==a[n])
	        {
	            for(ll i=0;i<n;i++)
	            {
	                cout<<a[i]<<" ";
	            }
	            cout<<endl;
	        }
	        else if(sum==a[n+1])
	        {
	            for(ll i=0;i<n;i++)
	            {
	                cout<<a[i]<<" ";
	            }
	            cout<<endl;
	        }
	        else{
	            sum+=a[n];
	            ll j=0;
	            ll p=0;
	            for(ll i=0;i<n;i++)
	            {
	                if(sum-a[i]==a[n+1])
	                {
	                     j=i;
	                    p=1;
	                    break;
	                }
	            }
	            if(p)
	            {
	                for(ll i=0;i<n;i++)
	                {
	                    if(i!=j)
	                    {
	                        cout<<a[i]<<" ";
	                    }
	                }
	                cout<<a[n]<<endl;
	            }
	            else{
	                cout<<-1<<endl;
	            }
	        }
	 	}
}






