def no_triangle(arr):
    for i in range(0,len(arr)-2):
        
        n1 = arr[i]
        n2 = arr[i+1]
        k = arr[i+2:] 
    for j in range(len(k)):
        
        if n1+n2<=k[j] or n2+k[j]<=n1 or n1+k[j]<=n2:
            l = [i+1,i+2,i+2+j+1]
            l.sort()
            return l 
        else:
            l = [] 
        return l
            
t = int(input())
for _ in range(t):
    n = int(input())
    arr = list(map(int,input().split()))
    result = no_triangle(arr)
    if result:
        print(*result,sep=" ") 
    else:
        print(-1)