#define Fast std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pr(x) cout<<#x<<": "<<x<<endl
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
int n;
ll a[maxn],b[maxn];
void output()
{
    for(int i=1;i<=n;++i) printf("%lld%c",a[i],i==n?'\n':' ');
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(int i=1;i<=n+2;++i) cin>>b[i];
        sort(b+1,b+1+n+2);
        ll sum=0;
        a[0]=0;
        for(int i=1;i<=n+1;++i) sum+=b[i];
        bool flag=false;
        for(int i=1;i<=n;++i)if((sum-b[i])==b[n+2]){
            for(int j=1;j<=n+1;++j)if(i!=j) a[++a[0]]=b[j];
            flag=true;
            break;
        }
        if(flag){
            output();
            continue;
        }   
        sum-=b[n+1];
        if(sum==b[n+1]||sum==b[n+2]){
            for(int i=1;i<=n;++i) a[++a[0]]=b[i];
            output();
        }
        else puts("-1");
    }
    return 0;
}