import java.util.*;
public class Solution {
	public static void main(String args[])
	{	
		Scanner take=new Scanner(System.in);
		int t=take.nextInt();
		int n,a[],i;
		while(t--!=0)
		{
			n=take.nextInt();
			a=new int[n];
			for(i=0;i<n;i++) a[i]=take.nextInt();
			double d=((a[0]+a[1]+a[n-1])/3.0);
			long k=(long)((d-a[0])*(d-a[1])*(d-a[2]));
			if(k>=0)
			System.out.println("-1");
			else System.out.println("1 2 "+(n));
			
		}
		
	}
	
}
