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
		for (int i = 0; i < n - 2; i++) {
			int A = arr[i];
			int B = arr[i + 1];
			int C = arr[i + 2];
			if (A + B > C) {
				System.out.println("-1");
				return;
			} else {
				System.out.println((i + 1) + " " + (i + 2) + " " + (i + 3));
				return;
			}
		}
	}

}
