#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
	int n;
	cin >> n;
	n += 2;
	ll sum = 0;
	ll del = -1;
	
	vector<ll>ve(n);
	set<ll>se;
	
	for(int i=0; i<n; i++) cin >> ve[i];
	sort(ve.begin(), ve.end());
	
	bool ok = 0;
	for(int i = 0; i < n; i++){
		sum += ve[i];
		se.insert(ve[i]);
		if(i == n-3 && sum == ve[n-2]){
			ve.pop_back();
			ve.pop_back();
			ok = 1;
			break;
		} else if(i == n-2 && sum > ve[n-1] && se.find(sum-ve[n-1]) != se.end()){
			ve.pop_back();
			del = sum - ve[n-1];
			ok=1;
			break;
		}
	}
	if(del != -1 && ok){
		bool al = 0;
		for(auto x : ve){
			if(!al && x == del){
				al = 1;
				continue;
			}
			cout << x << " ";
		}
		cout << endl;
	} else if(ok){
		for(auto x : ve){
			cout << x << " ";
		}
		cout << endl;
	} else {
		cout << -1 << endl;
	}
}
int main(){
	int t; cin>>t;
	while(t--){
		solve();
	}
	return 0;
}