import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;

public class Main
{
	public static void main(String args[])
	{
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext())
		{
			int x = sc.nextInt();
			while (x-- > 0)
			{
				long a[] = new long[sc.nextInt()];

				for (int i = 0; i < a.length; i++)
				{
					a[i] = sc.nextLong();
				}
				long b[] = a;
				Arrays.sort(b);
				long a1=0;long a2=0;long a3=0;
				
				if (b[0]+b[1]>=b[b.length-1])
				{
					System.out.println(-1);
				}else {
					
					for (int i = 0; i < a.length; i++)
					{
						if (a[i]==b[b.length-1])
						{
							a3=i+1;
						}
						if (a[i]==b[0])
						{
							a1=i+1;
						}
					}
					for (int i = 0; i < b.length; i++)
					{
						if (a[i]==b[1])
						{
							a2=i+1;break;
						}
					}
					System.out.println(a1+" "+a2+" "+a3);

				}
				
				
				
			}
		}

	}

}