#include<iostream>
#include<cstdlib>
#include<queue>
#include<random>
#include<map>
#include<cstring>
#include<string>
#include<unordered_map>
#include<algorithm>
using namespace std;
long long b[200010];
int main() {
	int q;
	cin >> q;

	unordered_map<long long, int> mp;
	while (q--) {
		mp.clear();
		int n;
		cin >> n;
		long long sum = 0;
		for (int i = 0; i < n + 2; i++) {
			cin >> b[i];
			mp[b[i]] = 1;
			sum += b[i];
		}
		sort(b, b + n + 2);
		mp[b[n + 1]] = 0;
		long long x = sum - 2 * b[n + 1], y = sum - 2 * b[n];
		//cout << sum << " " << x << " " << y << endl;
		if (mp[x]) {
			bool flag = true;
			for (int i = 0; i < n + 1; i++) {
				if (flag && b[i] == x) {
					flag = false;
					continue;
				}
				cout << b[i] << " ";
			}
			cout << endl;
		}
		else if (y == b[n + 1]) {
			for (int i = 0; i < n ; i++) {
				cout << b[i] << " ";
			}
			cout << endl;
		}
		else cout << -1 << endl;
	}

	return 0;
}