def main():
    t = int(input())
    for i in range(t):
        solve()

def solve():
    n = int(input())
    array = tuple(map(lambda x: int(x), input().split()))

    # the sum of the two lowest has to be higher than the largest
    for k in range(n - 1, -1, -1):
        if not (array[k] < array[k - 1] + array[k - 2]):
            print(k-1, k, k+1)
            return

    print(-1)

main()
