#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////*****************//////////////////////////////////////
typedef long long ll;
ll z=1000000007;
ll fact[400005];
void buildfact()
{
    fact[0]=1;
    for(ll i=1;i<400005;i++)
    {
        fact[i]=(fact[i-1]*i)%z;
    }
}
ll power(ll a,ll p)
{
    if(p==0)
        return 1;
    if(p%2==0)
        return power((a*a)%z,p/2);
    return (a*power(a,p-1))%z;
}
ll ncr(ll n,ll r)
{
    if(n<r)
        return 0;
    ll num=fact[n];
    ll deno=(fact[r]*fact[n-r])%z;
    deno=power(deno,z-2);
    ll ans=(num*deno)%z;
    return ans;
}
//////////////////////////////////////****************//////////////////////////////////////

void solve(int oper)
{
ll n;
cin>>n;
ll arr[n+2];
for(int i=0;i<n+2;i++)
    cin>>arr[i];
sort(arr,arr+n+2);
int skip=-1;
ll sum=0;
for(int i=0;i<n+1;i++)
{
   sum+=arr[i];
}
if(sum-arr[n]==arr[n])
{
    for(int i=0;i<n;i++)
        cout<<arr[i]<<" ";
    cout<<endl;
    return;
}
for(int i=0;i<n+1;i++)
{
    if(sum-arr[i]==arr[n+1])
        skip=i;
}
if(skip==-1)
{
    cout<<-1<<endl;
    return;
}
for(int i=0;i<n+1;i++)
{
    if(i!=skip)
    {
        cout<<arr[i]<<" ";
    }
}
cout<<endl;
return ;
}
int main()
{
    ll t;
    t=1;
    cin>>t;
   //buildfact();
    int i=1;
    while(i<=t)
    {
        solve(i);
        i++;
    }
    return 0;
}
