import java.util.*;
import java.io.*;
import java.math.BigInteger;
import static java.lang.Math.*;
 
public class Main
{
	static final int mod = (int)1e9+7;
	public static void main(String[] args) throws Exception
	{
		FastReader in = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		int test = in.nextInt();
		while(test-- > 0)
		{
			int n = in.nextInt();
			int min1 = in.nextInt();
			int min2 = in.nextInt();
			for(int i = 2; i < n - 1; i++) {
				in.nextInt();
			}
			int max = in.nextInt();
			if(min1 + min2 > max) {
				out.println(-1);
			}
			else {
				out.println(min1 + " " + min2 + " " + max);
			}
		}
		out.flush();
	}
}

class FastReader
{
	BufferedReader br;
	StringTokenizer st;
 
	public FastReader()
	{
	    br = new BufferedReader(new InputStreamReader(System.in));
	}
 
	public String next() throws IOException
	{
	    if(st == null || !st.hasMoreElements())
	    {
	        st = new StringTokenizer(br.readLine());
	    }

	    return st.nextToken();
	}

	public boolean hasNext() throws IOException
	{
		if(st != null && st.hasMoreElements())
		{
			return true;
		}

		String s = br.readLine();
		if(s == null) {
			return false;
		}

		st = new StringTokenizer(s);

		return st.hasMoreElements();
	}
 
	public int nextInt() throws IOException
	{
	    return Integer.parseInt(next());
	}
 
	public long nextLong() throws IOException
	{
	    return Long.parseLong(next());
	}
 
	public String nextLine() throws IOException
	{
		return br.readLine();
	}
}