import math
import time
from collections import defaultdict,deque,Counter
from sys import stdin,stdout
from bisect import bisect_left,bisect_right
from queue import PriorityQueue 
import sys
t=1
t=int(input())
for _ in range(t):
    n=int(input())
    a=list(map(int,stdin.readline().split()))
    poss=False
    for i in range(n-2):
        if(a[i+2]>=a[i]+a[i+1]):
            poss=[i+1,i+2,i+3]
            break
    if(poss==False):
        print(-1)
    else:
        print(*poss)