#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 +10 ;
long long  all[N] ;
int n, t;

int main()
{
	cin>>t;
	while(t --)
	{
		cin>>n;
		for(int i = 0 ; i < n + 2 ; i ++ ) cin>>all[i];
		
		sort(all , all + n + 2 );
		
		long long a = 0 ;
		for(int i = 0 ; i < n ; i ++) a += all[i];
		
		if(a == all[n] || a == all[n + 1 ]) 
		{
			for(int i = 0 ; i < n ; i ++) cout<<all[i]<<" ";
			cout<<endl;
		}
		else 
		{
			long long r = a + all[n ] - all[n + 1];
			long long k = -1 ;
			int ok = 1;
			//cout<<r<<endl;
			for(int i = 0 ; i < n; i ++)
			{
				if(all[i] == r) 
				{
					k = all[i];
					break;
				}
			}
			
			if(k == -1) cout<<"-1"<<endl;
			else
			{
				for(int i = 0 ; i < n + 1 ; i ++)
				{
					if(ok == 1 && all[i] == k) 
					{
						ok = 0;
					}
					else
					{
						cout<<all[i]<<" ";
					}
				}
				cout<<endl;
				
			}
		}
	}
	return 0;
}