#include <bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<#x<<"="<<x<<endl;
#define endl '\n'
#define M 1000000007
#define int long long
#define F first
#define S second
#define INF 1e18
#define N 1000005

using namespace std;


ll b[200005];

void solve()
{
	ll n;
	cin >> n;

	ll actual = 0;
	for (int i = 0; i < n + 2; ++i)
	{
		cin >> b[i];
		actual += b[i];
	}
	sort(b, b + n + 2);
	ll sum = b[n + 1];
	ll act = actual;
	act -= sum;
	for (int i = 0; i < n + 1; ++i)
	{
		act -= b[i];
		if (act == sum)
		{
			for (int j = 0; j < n + 2; ++j)
			{
				if (j == n + 1)continue;
				if (j == i)continue;
				cout << b[j] << " ";
			}
			cout << endl;
			return;
		}
		act += b[i];
	}

	sum = b[n];

	act = actual;
	act -= sum;
	for (int i = 0; i < n + 2; ++i)
	{
		if (i == n)continue;
		act -= b[i];
		if (act == sum)
		{
			for (int j = 0; j < n + 2; ++j)
			{
				if (j == n)continue;
				if (j == i)continue;
				cout << b[j] << " ";
			}
			cout << endl;
			return;
		}
		act += b[i];
	}

	cout << -1 << endl;

}

int32_t main()
{
	IOS
	ll T = 1;
	cin >> T;
	for (ll i = 1; i <= T; ++i)
	{
		// cout<<"Case #"<<i<<": ";
		solve();
	}
	return 0;
}