
def isPossibleTriangle(arr, N):
        f=0
        # loop for all 3
        # consecutive triplets
        for i in range(N - 2):

            # If triplet satisfies triangle
            # condition, break
            if (arr[i] + arr[i + 1] <= arr[i + 2]) and (arr[i+1] + arr[i + 2] <= arr[i]) and (arr[i] + arr[i + 2] <= arr[i + 1]):
                p = i+1
                q=i+2
                r=i+3
                f=1
                break

        if f==1:
            print(p, q, r)
        else:
            print(-1)

t = int(input())
for T in range(t):
    n = int(input())
    l = list(map(int, input().split()))
    isPossibleTriangle(l, n)
