#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+10;
const int M=1e3+10;
ll bi[N];
int pos,n;
ll sum=0;
int judge(int flag)
{
    if(flag==1)
    {
        ll temp=sum-bi[n+2];
        for(int i=n+1;i>=1;i--){
            if(bi[n+2]==temp-bi[i]){
                pos=i;
                return 1;
            }
        }
        return 0;
    }
    else if(flag==2){
        if(sum-bi[n+2]==2*bi[n+1]) return 1;
        else return 0;
    }
}
void solve()
{
    cin>>n;
    sum=0;
    for(int i=1;i<=n+2;i++){
        cin>>bi[i];
        sum+=bi[i];
    }
    sort(bi+1,bi+1+n+2);
    if(judge(1)){
        for(int i=1;i<=n+1;i++){
            if(i!=pos) cout<<bi[i]<<' ';
        }
        cout<<endl;
    }
    else if(judge(2))
    {
        for(int i=1;i<=n;i++){
            cout<<bi[i]<<' ';
        }
        cout<<endl;
    }
    else{
        cout<<-1<<endl;
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}
