import java.util.Scanner;

public class BadTriangle {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while (t-- > 0) {
			int n = sc.nextInt();
			int[] arr = new int[n];
			for (int i = 0; i < arr.length; i++) {
				arr[i] = sc.nextInt();
			}
			solve(arr, n);
		}
	}

	private static void solve(int[] arr, int n) {
		// TODO Auto-generated method stub
		int a = 0, b = 0, c = 0, nd = 0, d = 0;
		for (int i = 0; i < n - 2; i++) {
			int A = arr[i];
			int B = arr[i + 1];
			int C = arr[i + 2];
//			System.out.println(A + " " + B + " " + C);
			if (A + B > C) nd++;
			else {
				a = i + 1; b = i + 2; c = i + 3;
				System.out.println(a + " " + b + " " + c);
				return;
//				d++;
			}
		}
//		if (d > 0) System.out.println(a + " " + b + " " + c);
//		else 
		System.out.println(-1);
	}

}
