You are given an array $a_1, a_2, \dots , a_n$, which is sorted in non-decreasing order ($a_i \le a_{i + 1})$. 

Find three indices $i$, $j$, $k$ such that $1 \le i < j < k \le n$ and it is impossible to construct a non-degenerate triangle (a triangle with nonzero area) having sides equal to $a_i$, $a_j$ and $a_k$ (for example it is possible to construct a non-degenerate triangle with sides $3$, $4$ and $5$ but impossible with sides $3$, $4$ and $7$). If it is impossible to find such triple, report it.


-----Input-----

The first line contains one integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The first line of each test case contains one integer $n$ ($3 \le n \le 5 \cdot 10^4$) — the length of the array $a$.

The second line of each test case contains $n$ integers $a_1, a_2, \dots , a_n$ ($1 \le a_i \le 10^9$; $a_{i - 1} \le a_i$) — the array $a$.

It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.


-----Output-----

For each test case print the answer to it in one line.

If there is a triple of indices $i$, $j$, $k$ ($i < j < k$) such that it is impossible to construct a non-degenerate triangle having sides equal to $a_i$, $a_j$ and $a_k$, print that three indices in ascending order. If there are multiple answers, print any of them.

Otherwise, print -1.


-----Example-----
Input
3
7
4 6 11 11 15 18 20
4
10 10 10 11
3
1 1 1000000000

Output
2 3 6
-1
1 2 3



-----Note-----

In the first test case it is impossible with sides $6$, $11$ and $18$. Note, that this is not the only correct answer.

In the second test case you always can construct a non-degenerate triangle.

Source: codeforces | Difficulty: EASY
Tags: Geometry

Mathematics


Solutions:
for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


for _ in range(int(input())):
	n = int(input())
	lis = list(map(int, input().split()))
	if lis[0] + lis[1] > lis[-1]:
		print(-1)
	else:
		print(1, 2, n)


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a1 = a[0]
	a2 = a[1]
	a3 = a[-1]
	if a1 + a2 <= a3:
		print(1, 2, len(a))
	else:
		print(-1)


import itertools

def testcases(a, n):
	if a[0] + a[1] <= a[n - 1]:
		return (1, 2, n)
	else:
		return -1
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	ans = testcases(a, n)
	if ans == -1:
		print(-1)
	else:
		for i in ans:
			print(i, end=' ')
		print()


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(i) for i in input().split(' ')]
	i = 0
	j = 1
	k = len(a) - 1
	while j < k:
		if a[i] + a[j] <= a[k]:
			print(i + 1, j + 1, k + 1)
			break
		i += 1
		j += 1
	if j >= k:
		print(-1)


T = int(input())
for t in range(T):
	n = int(input())
	A = list(map(int, input().split(' ')))
	if A[0] + A[1] <= A[-1]:
		print(1, 2, n)
	else:
		print(-1)


def fun(ls, n):
	prv = ls[0]
	prv_index = 0
	for (i, val) in enumerate(ls[1:-1]):
		i = i + 1
		nxt_index = i + 1
		nxt = ls[nxt_index]
		if prv + val <= nxt:
			print(prv_index + 1, i + 1, nxt_index + 1)
			return
		prv = val
		prv_index = i
	if ls[0] + ls[1] <= ls[-1]:
		print(1, 2, n)
		return
	print(-1)
T = int(input())
for i in range(T):
	val = int(input())
	st = list(map(int, input().split()))
	fun(st, val)


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	for i in range(2, len(l)):
		if l[0] + l[1] <= l[i]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


import sys
t = int(sys.stdin.readline())
for _ in range(t):
	n = int(sys.stdin.readline())
	a = list(map(int, sys.stdin.readline().split()))
	counter = 0
	for i in range(n - 1):
		su = a[i] + a[i + 1]
		if su <= a[n - 1]:
			print('{} {} {}'.format(i + 1, i + 2, n))
			counter = 1
			break
	if counter == 0:
		print(-1)


from collections import defaultdict
t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	a = [int(j) for j in input().split()]
	if a[0] + a[1] <= a[-1]:
		print('1 2', end=' ')
		print(len(a))
	else:
		print(-1)


import os
inp = os.read(0, os.fstat(0).st_size).split(b'\n')
_ii = -1

def rdln():
	global _ii
	_ii += 1
	return inp[_ii]
inin = lambda : int(rdln())
inar = lambda : [int(x) for x in rdln().split()]
inst = lambda : rdln().strip().decode()
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


for test in range(0, int(input())):
	n = int(input())
	arr = [int(x) for x in input().split()]
	one = arr[0]
	two = arr[1]
	third = arr[n - 1]
	if one + two > third:
		print(-1)
	else:
		print(1, 2, n)


import sys
inp = sys.stdin.buffer.readline

def inin(typ=int):
	return typ(inp())

def inar(typ=int):
	return list(map(typ, inp().split()))
inst = lambda : inp().decode().strip()
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	sum1 = l[0] + l[1]
	zero = 0
	for j in range(2, n):
		if l[j] >= sum1:
			print(1, 2, j + 1)
			zero = 1
			break
	if zero == 0:
		print('-1')


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	c = 0
	for i in range(2, n):
		l = i
		r = n - 1
		if a[0] + a[1] <= a[l]:
			c += 1
			print(1, 2, i + 1)
			break
	if c == 0:
		print(-1)


for i in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	flag = 0
	for i in range(len(arr) - 1):
		for j in range(i + 1, len(arr) - 1):
			if arr[i] + arr[j] <= arr[len(arr) - 1]:
				flag = 1
				print(i + 1, j + 1, len(arr))
				m = len(arr)
				arr.remove(arr[m - 1])
				break
		break
	if flag == 0:
		print(-1)


t = int(input())
for castle in range(t):
	n = int(input())
	ls = list(map(int, input().split()))
	(a, b, c) = (ls[0], ls[1], ls[-1])
	if a + b > c:
		print(-1)
	else:
		print(*[1, 2, n])


from math import *
from cmath import *
from itertools import *
from decimal import *
from fractions import *
from sys import *
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	ok = 0
	for x in range(2, n):
		if a[x] >= a[0] + a[1]:
			print(1, 2, x + 1)
			ok = 1
			break
	if not ok:
		print(-1)


import bisect
t = int(input())
ans = []
for _ in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	i = 0
	j = 1
	check_index = bisect.bisect_left(A, A[i] + A[j])
	if check_index >= n:
		ans.append([-1])
	else:
		k = check_index
		ans.append([i + 1, j + 1, k + 1])
for a in ans:
	print(*a)


for _ in range(int(input())):
	size = int(input())
	v = list(map(int, input().split()))
	if v[0] + v[1] <= v[-1]:
		print(1, 2, size)
	else:
		print(-1)


t = int(input())
nLst = []
triLst = []
for tt in range(t):
	n_i = int(input())
	nLst.append(n_i)
	tri = input().split()
	for x in range(len(tri)):
		tri[x] = int(tri[x])
	triLst.append(tri)
for i in range(t):
	for j in range(2, len(triLst[i])):
		if triLst[i][0] + triLst[i][1] <= triLst[i][j]:
			print('1 2', j + 1)
			break
		elif j == len(triLst[i]) - 1:
			print(-1)
			break
		else:
			continue


import sys
inp = sys.stdin.buffer.read().split(b'\n')
_ii = -1

def rdln():
	global _ii
	_ii += 1
	return inp[_ii]
inin = lambda typ=int: typ(rdln())
inar = lambda typ=int: [typ(x) for x in rdln().split()]
inst = lambda : rdln().strip().decode()
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


T = int(input())
for t in range(T):
	n = int(input())
	l = [int(k) for k in input().split()]
	i = 0
	j = 1
	k = 2
	f = 0
	for m in range(2, n):
		if l[i] + l[j] <= l[m]:
			k = m
			f = 1
			break
	if f == 1:
		print(i + 1, j + 1, k + 1)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[n - 1] or a[0] + a[n - 1] <= a[1] or a[1] + a[n - 1] <= a[0]:
		print(1, 2, n)
	else:
		print('-1')


import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	res = 0
	n = int(input())
	A = list(map(int, input().split()))
	flag = 0
	(a, b, c) = (A[0], A[1], A[-1])
	if c >= a + b:
		print(1, 2, n)
		flag = 1
	if not flag:
		(a, b, c) = (A[0], A[-2], A[-1])
		if c - b >= a:
			print(1, n - 2, n - 1)
			flag = 1
	if not flag:
		print(-1)


import math
import sys
import itertools
import random
import bisect
import heapq
import collections

def lcm(x, y):
	return x * y // math.gcd(x, y)

def hcf(x, y):
	return math.gcd(x, y)

def primes(n):
	prime = [True for _ in range(0, n + 1)]
	res = []
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[p] = False
		p += 1
	for i in range(0, n + 1):
		if prime[i] == True:
			res.append(i)
	return res

def primeFactors(n):
	res = []
	while n % 2 == 0:
		res.append(2)
		n //= 2
	for i in range(3, math.sqrt(n) + 1, 2):
		while n % i == 0:
			res.append(i)
			n //= i
	if n > 2:
		res.append(n)
	return res
for _ in range(0, int(input())):
	n = int(input())
	l = list(map(int, input().strip().split()))
	i = l[0]
	j = l[1]
	flag = 0
	for ie in range(2, n):
		if l[ie] >= i + j:
			print(1, 2, ie + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


import math
from collections import deque
from sys import stdin, stdout
from string import ascii_letters
input = stdin.readline
letters = ascii_letters[:26]
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	first = arr[0]
	second = arr[-1]
	can = False
	res = 0
	for i in range(1, n - 1):
		if arr[i] + first <= second or arr[i] + second <= first:
			can = True
			res = i
			break
	if can:
		print(*[1, res + 1, n])
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	s = a[0] + a[1]
	c = False
	for i in range(2, n):
		if s <= a[i]:
			c = True
			break
	if c is True:
		print(1, 2, i + 1)
	else:
		print(-1)


import sys
import math
import time
from functools import lru_cache
from collections import Counter
import heapq

def pw(a, b, m):
	a %= m
	ans = 1
	if a == 0:
		return 0
	while b > 0:
		if b & 1:
			ans = ans * a % m
		b = b // 2
		a = a * a % m
	return ans
try:
	for _ in range(int(input())):
		n = int(input())
		arr = [int(i) for i in input().split()]
		ans = arr[0] + arr[1]
		flg = 0
		pos = 0
		for i in range(2, n):
			if ans <= arr[i]:
				flg = 1
				pos = i
				break
		if flg == 0:
			print(-1)
		else:
			print(1, 2, pos + 1)
except EOFError as e:
	print(e)


import sys
input = sys.stdin.readline
for nt in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	k = list(map(int, input().split()))
	(a, b, c) = (0, 1, n - 1)
	if k[a] + k[b] > k[c]:
		print(-1)
	else:
		print(a + 1, b + 1, c + 1)


for u in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	s = l[0] + l[1]
	f = 0
	for i in range(2, n):
		if l[n - 1] >= s:
			f = 1
			print(1, 2, n)
			break
	if f == 0:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	c = 0
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
		c = 1
	if c == 0:
		print(-1)


try:
	t = int(input())
	while t != 0:
		n = int(input())
		arr = list(map(int, input().split()))
		if arr[0] + arr[1] <= arr[n - 1]:
			print(1, 2, n)
		else:
			print(-1)
		t = t - 1
except EOFError:
	print(' ')


for _ in range(int(input())):
	n = int(input())
	a = [*map(int, input().split())]
	ok = 0
	for i in range(2, n):
		if a[i] >= a[0] + a[1]:
			print(1, 2, i + 1)
			ok = 1
			break
	if not ok:
		print(-1)


import io, os
from collections import deque
import bisect
from collections import deque
RL = lambda : list(map(int, input().split(' ')))
T = int(input())
for _ in range(T):
	n = int(input())
	l = RL()
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	nList = list(map(int, input().split()))
	if nList[0] + nList[1] > nList[-1]:
		print(-1)
	else:
		print(1, 2, n)


tests = int(input())
for test in range(tests):
	n = int(input())
	a = [int(i) for i in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


import math, sys
from collections import defaultdict, Counter, deque
INF = float('inf')
MOD = 10 ** 9 + 7

def gcd(a, b):
	while b:
		(a, b) = (b, a % b)
	return a

def isPrime(n):
	if n <= 1:
		return False
	i = 2
	while i ** 2 <= n:
		if n % i == 0:
			return False
		i += 1
	return True

def primeFactors(n):
	factors = []
	i = 2
	while i ** 2 <= n:
		while n % i == 0:
			factors.append(i)
			n //= i
		i += 1
	if n > 1:
		factors.append(n)
	return factors

def vars():
	return map(int, input().split())

def array():
	return list(map(int, input().split()))

def main():
	n = int(input())
	arr = array()
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)
t = 1
t = int(input())
for _ in range(t):
	main()


t = int(input())
for i in range(0, t):
	n = int(input())
	a = [] * n
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[len(a) - 1]:
		print(f'1 2 {len(a)}')
	else:
		print('-1')


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	v = a[0] + a[1]
	ans = 0
	for i in range(2, n):
		if a[i] >= v:
			ans = i
			break
	if ans:
		print(1, 2, ans + 1)
	else:
		print(-1)


import sys
import heapq, functools, collections
import math, random
from collections import Counter, defaultdict

def solve(lst):
	console('----- solving ------')
	lst = sorted(lst)
	if lst[0] + lst[1] > lst[-1]:
		return -1
	else:
		return '{} {} {}'.format(1, 2, len(lst))

def console(*args):
	print('\x1b[36m', *args, '\x1b[0m', file=sys.stderr)
	return
for case_num in range(int(input())):
	_ = int(input())
	lst = list(map(int, input().split()))
	res = solve(lst)
	print(res)


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	c = a[0] + a[1]
	ans = False
	for i in range(2, n):
		if c <= a[i]:
			print(1, 2, i + 1)
			ans = True
			break
	if not ans:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	ans = [-1]
	a.sort()
	if a[0] + a[1] <= a[n - 1]:
		ans = [1, 2, n]
	print(*ans)


def badTriangle(arr):
	if arr[0] + arr[1] in arr:
		print(*[1, 2, arr.index(arr[0] + arr[1]) + 1])
	elif arr[0] + arr[1] <= arr[-1]:
		print(*[1, 2, len(arr)])
	else:
		print(-1)
tc = int(input())
for i in range(tc):
	n = int(input())
	a = list(map(int, input().split()))
	badTriangle(a)


for _ in range(int(input())):
	ans = 0
	n = int(input())
	tri = list(map(int, input().split()))
	if tri[0] + tri[1] <= tri[-1]:
		print(1, 2, len(tri))
		ans += 1
	if ans == 0:
		print(-1)


import sys
inp = sys.stdin.buffer.readline
inin = lambda : int(inp())
inar = lambda : [int(x) for x in inp().split()]
inst = lambda : inp().decode().strip()
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


def main():
	for _ in range(int(input())):
		n = int(input())
		A = [int(e) for e in input().split()]
		i = 0
		j = 1
		k = n - 1
		if A[i] + A[j] <= A[k]:
			print(i + 1, j + 1, k + 1)
		else:
			print(-1)
main()


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	k = a[0]
	m1 = 0
	for j in a:
		if j >= a[0] + a[1]:
			print(1, 2, a.index(j) + 1)
			break
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	a = arr[0]
	b = arr[1]
	flag = False
	for i in range(2, n):
		if a + b <= arr[i]:
			print(1, 2, i + 1)
			flag = True
			break
	if flag is False:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	s = [int(i) for i in input().split()]
	a = s[0] + s[1]
	k = -1
	for j in range(2, n):
		if a <= s[j]:
			k = j + 1
			break
	if k != -1:
		print(1, 2, k)
	else:
		print(-1)


t = int(input())

def check(a, j):
	for i in range(n - 1, j, -1):
		if arr[i] > a:
			return [True, i]
	return [False, -1]
while t:
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] <= arr[n - 1]:
		print(1, 2, n)
	else:
		print('-1')
	t -= 1


def solve():
	n = int(input())
	a = [int(x) for x in input().split(' ')]
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)

def main():
	T = int(input())
	while T > 0:
		T -= 1
		solve()
main()


a = int(input())
for i in range(a):
	b = int(input())
	c = list(map(int, input().split()))
	if c[0] + c[1] > c[-1]:
		print(-1)
	else:
		print(1, 2, len(c))


t = int(input())
while t > 0:
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		print('-1')
	else:
		print(1, 2, n)
	t -= 1


t = int(input())
for _ in range(t):
	n = int(input())
	l1 = [int(x) for x in input().split()]
	flag = 0
	if l1[0] + l1[1] <= l1[-1]:
		flag = 1
	if flag:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = [int(x) for x in input().split()]
	f = 0
	for i in range(n - 2):
		temp = l[i] + l[i + 1]
		if l[n - 1] >= temp:
			print(i + 1, i + 2, n)
			f = 1
			break
	if f == 0:
		print(-1)


for _ in range(int(input())):
	n = input()
	lengths = tuple(map(int, input().split()))
	if lengths[0] + lengths[1] > lengths[-1]:
		print(-1)
	else:
		print(1, 2, n)


import sys
stdin = sys.stdin
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
ns = lambda : stdin.readline().rstrip()
t = ni()
for _ in range(t):
	n = ni()
	ar = [int(x) for x in input().split()]
	if ar[0] + ar[1] <= ar[-1]:
		print('1 2 ' + str(n))
	else:
		print('-1')


for _ in range(int(input())):
	n = int(input())
	w = [int(i) for i in input().split()]
	if w[0] + w[1] <= w[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	f = 0
	for i in range(2, len(a)):
		if a[0] + a[1] <= a[i]:
			f = 1
			print('1 2', i + 1)
			break
	if f == 0:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	s = a[0] + a[1]
	flag = 0
	for i in range(2, n):
		if a[i] >= s:
			flag = 1
			break
	if flag:
		print(1, 2, i + 1)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print('-1')
	else:
		print(str('1') + ' ' + str('2') + ' ' + str(n))


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()))
	if a[-1] >= a[0] + a[1]:
		print(1, 2, n)
	else:
		print(-1)


test_cases = int(input())
for _ in range(test_cases):
	n = int(input())
	nums = list(map(int, input().split()))
	if nums[0] + nums[1] > nums[-1]:
		print('-1')
	else:
		print(1, 2, n)


def solve(arr, n):
	if arr[-1] >= arr[0] + arr[1]:
		print(1, 2, n)
		return
	print(-1)
t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	solve(arr, n)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split(' ')))
	(i, j, k) = (0, 1, 2)
	while i < n - 2:
		while j < n - 1:
			while k < n:
				if a[i] + a[j] <= a[k]:
					print(i + 1, j + 1, k + 1)
					(i, j, k) = (n, n, n)
					break
				else:
					k += 1
			j += 1
		i += 1
	if i == n - 2 and j == n - 1 and (k == n):
		print(-1)


for i in range(int(input())):
	n = input()
	arr = input().split()
	if int(arr[0]) + int(arr[1]) <= int(arr[-1]):
		print(1, 2, len(arr))
	else:
		print(-1)


def find(li, n):
	for i in range(n - 2):
		if li[i] + li[i + 1] <= li[n - 1]:
			return (i + 1, i + 2, n)
	return None
for j in range(int(input())):
	n = int(input())
	li = [int(x) for x in input().split()]
	print(*find(li, n)) if find(li, n) != None else print(-1)


import sys
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2 ** 62 - 1

def read_int():
	return int(buff_readline())

def read_int_n():
	return list(map(int, buff_readline().split()))

def read_float():
	return float(buff_readline())

def read_float_n():
	return list(map(float, buff_readline().split()))

def read_str():
	return readline().strip()

def read_str_n():
	return readline().strip().split()

def error_print(*args):
	print(*args, file=sys.stderr)

def mt(f):
	import time

	def wrap(*args, **kwargs):
		s = time.time()
		ret = f(*args, **kwargs)
		e = time.time()
		error_print(e - s, 'sec')
		return ret
	return wrap

@mt
def slv(N, A):
	ans = [-1]
	if A[0] + A[1] <= A[-1]:
		ans = (1, 2, N)
	return ans

def main():
	for _ in range(read_int()):
		N = read_int()
		A = read_int_n()
		print(*slv(N, A))
main()


from bisect import bisect_left, bisect_right
from itertools import combinations
from itertools import permutations
from bisect import bisect_left
from math import ceil
from math import radians
from heapq import heapify, heappush, heappop
import bisect
from math import pi
from collections import deque
from math import factorial
from math import log, ceil
from collections import defaultdict
from math import *
from sys import stdin, stdout
import itertools
import os
import sys
import threading
from collections import deque, Counter, OrderedDict, defaultdict
from heapq import *
from fractions import Fraction
mod = int(pow(10, 9) + 7)

def ii():
	return int(input())

def si():
	return str(input())

def mi():
	return map(int, input().split())

def li1():
	return list(mi())

def fii():
	return int(stdin.readline())

def fsi():
	return str(stdin.readline())

def fmi():
	return map(int, stdin.readline().split())

def fli():
	return list(fmi())
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}

def getKey(item):
	return item[0]

def sort2(l):
	return sorted(l, key=getKey)

def d2(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def ntl(n):
	return [int(i) for i in str(n)]

def powerMod(x, y, p):
	res = 1
	x %= p
	while y > 0:
		if y & 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res
graph = defaultdict(list)
visited = [0] * 1000000
col = [-1] * 1000000

def bfs(d, v):
	q = []
	q.append(v)
	visited[v] = 1
	while len(q) != 0:
		x = q[0]
		q.pop(0)
		for i in d[x]:
			if visited[i] != 1:
				visited[i] = 1
				q.append(i)
		print(x)

def make_graph(e):
	d = {}
	for i in range(e):
		(x, y) = mi()
		if x not in d:
			d[x] = [y]
		else:
			d[x].append(y)
		if y not in d:
			d[y] = [x]
		else:
			d[y].append(x)
	return d

def gr2(n):
	d = defaultdict(list)
	for i in range(n):
		(x, y) = mi()
		d[x].append(y)
	return d

def connected_components(graph):
	seen = set()

	def dfs(v):
		vs = set([v])
		component = []
		while vs:
			v = vs.pop()
			seen.add(v)
			vs |= set(graph[v]) - seen
			component.append(v)
		return component
	ans = []
	for v in graph:
		if v not in seen:
			d = dfs(v)
			ans.append(d)
	return ans

def primeFactors(n):
	s = set()
	while n % 2 == 0:
		s.add(2)
		n = n // 2
	for i in range(3, int(sqrt(n)) + 1, 2):
		while n % i == 0 and i % 2 == 1:
			s.add(i)
			n = n // i
	if n > 2 and n % 2 == 1:
		s.add(n)
	return s

def find_all(a_str, sub):
	start = 0
	while True:
		start = a_str.find(sub, start)
		if start == -1:
			return
		yield start
		start += len(sub)

def SieveOfEratosthenes(n, isPrime):
	isPrime[0] = isPrime[1] = False
	for i in range(2, n):
		isPrime[i] = True
	p = 2
	while p * p <= n:
		if isPrime[p] == True:
			i = p * p
			while i <= n:
				isPrime[i] = False
				i += p
		p += 1
	return isPrime

def dijkstra(edges, f, t):
	g = defaultdict(list)
	for (l, r, c) in edges:
		g[l].append((c, r))
	(q, seen, mins) = ([(0, f, ())], set(), {f: 0})
	while q:
		(cost, v1, path) = heappop(q)
		if v1 not in seen:
			seen.add(v1)
			path = (v1, path)
			if v1 == t:
				return (cost, path)
			for (c, v2) in g.get(v1, ()):
				if v2 in seen:
					continue
				prev = mins.get(v2, None)
				next = cost + c
				if prev is None or next < prev:
					mins[v2] = next
					heappush(q, (next, v2, path))
	return float('inf')

def binsearch(a, l, r, x):
	while l <= r:
		mid = l + (r - 1) // 2
		if a[mid]:
			return mid
		elif a[mid] > x:
			l = mid - 1
		else:
			r = mid + 1
	return -1

def readTree(n):
	adj = [set() for _ in range(n)]
	for _ in range(n - 1):
		(u, v) = map(int, input().split())
		adj[u - 1].add(v - 1)
		adj[v - 1].add(u - 1)
	return adj

def treeOrderByDepth(n, adj, root=0):
	parent = [-2] + [-1] * (n - 1)
	ordered = []
	q = deque()
	q.append(root)
	depth = [0] * n
	while q:
		c = q.popleft()
		ordered.append(c)
		for a in adj[c]:
			if parent[a] == -1:
				parent[a] = c
				depth[a] = depth[c] + 1
				q.append(a)
	return (ordered, parent, depth)

def isSubSequence(str1, str2):
	m = len(str1)
	n = len(str2)
	j = 0
	i = 0
	while j < m and i < n:
		if str1[j] == str2[i]:
			j = j + 1
		i = i + 1
	return j == m

def nextPowerOf2(n):
	count = 0
	if n and (not n & n - 1):
		return n
	while n != 0:
		n >>= 1
		count += 1
	return 1 << count

def cou(n):
	c = 0
	while n > 1:
		c += 1
		n //= 2
	return c

def sortsec(l):
	return sorted(l, key=lambda x: x[1])

def BinarySearch(a, x):
	i = bisect_left(a, x)
	if i:
		return i - 1
	else:
		return -1

def subarray(A):
	r = set()
	p = {0}
	for x in A:
		p = {x | y for y in p} | {x}
		r |= p
	return len(r)
for _ in range(ii()):
	n = ii()
	l = li1()
	if l[0] + l[1] > l[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


from sys import stdin
input = lambda : stdin.readline().strip()
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	r = range(1, n + 1)
	a.insert(0, n - 1)
	ans = False
	x = a[1]
	y = a[2]
	for k in range(2, n + 1):
		if x + y <= a[k]:
			print(1, 2, k)
			ans = True
			break
	if not ans:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	(i1, i2, i3) = (a[0], a[1], a[-1])
	if i1 + i2 <= i3 or i1 + i3 <= i2 or i3 + i2 <= i1:
		print(1, 2, n)
	else:
		print(-1)


test = int(input())
for _ in range(test):
	n = int(input())
	list1 = list(map(int, input().split()))
	if list1[0] + list1[1] <= list1[n - 1]:
		print(1, 2, n)
	else:
		print('-1')


import sys, math, heapq, collections, itertools, bisect
sys.setrecursionlimit(101000)

def solve(n, a):
	(l1, l2, l3) = (a[0], a[1], a[n - 1])
	if l1 + l2 <= l3:
		return (1, 2, n)
	return (None, None, None)
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	(i, j, k) = solve(n, a)
	if i is None:
		print(-1)
	else:
		print(i, j, k)


for i1 in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	t1 = a[0]
	t2 = a[1]
	t3 = a[-1]
	if t3 >= t1 + t2:
		print(1, 2, n)
		continue
	else:
		print(-1)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import gcd, ceil

def pre(s):
	n = len(s)
	pi = [0] * n
	for i in range(1, n):
		j = pi[i - 1]
		while j and s[i] != s[j]:
			j = pi[j - 1]
		if s[i] == s[j]:
			j += 1
		pi[i] = j
	return pi

def prod(a):
	ans = 1
	for each in a:
		ans = ans * each
	return ans

def lcm(a, b):
	return a * b // gcd(a, b)

def binary(x, length=16):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y
for _ in range(int(input()) if True else 1):
	n = int(input())
	a = list(map(int, input().split()))
	found = False
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
		found = True
	if not found:
		print(-1)


from sys import stdin
input = stdin.buffer.readline
inf = 1000000001
for _ in range(int(input())):
	n = int(input())
	(*a,) = map(int, input().split())
	a = sorted([(a[i], i + 1) for i in range(n)])
	if a[-1][0] >= a[0][0] + a[1][0]:
		print(*sorted([a[0][1], a[1][1], a[-1][1]]))
	else:
		print(-1)


test = int(input())
for t in range(test):
	n = int(input())
	lst = list(map(int, input().split()))
	maxm = max(lst)
	minm = lst[0]
	final = list()
	for i in range(n):
		if lst[i] == maxm:
			c = i + 1
			break
	Ase = False
	for i in range(1, len(lst)):
		if minm + lst[i] <= maxm:
			b = i + 1
			Ase = True
			break
	if Ase == True:
		print(1, b, c)
	else:
		print(-1)


from sys import stdin

def readline():
	return stdin.readline()
tests = int(readline())

def solve(n, a):
	i = 0
	j = 1
	k = n - 1
	if a[k] >= a[i] + a[j] or a[i] >= a[k] + a[j] or a[j] >= a[i] + a[k]:
		return str(i + 1) + ' ' + str(j + 1) + ' ' + str(k + 1)
	return -1
for t in range(0, tests):
	n = int(readline().rstrip('\n'))
	a = list(map(int, readline().rstrip('\n').split(' ')))
	print(solve(n, a))


t = int(input())
for _ in range(t):
	n = int(input())
	ar = list(map(int, input().split()))
	a = ar[0]
	b = ar[1]
	c = ar[-1]
	if c >= a + b:
		print(1, 2, n)
	else:
		print(-1)


T = int(input())
for _ in range(T):
	n = int(input())
	data = list(map(int, input().split()))
	if sum(data[0:2]) > data[-1]:
		print(-1)
	else:
		impos = False
		for i in range(len(data) - 1):
			(a, b) = data[i:i + 2]
			isPos = False
			for j in range(i + 2, n):
				c = data[j]
				if a + b <= c:
					print(i + 1, i + 2, j + 1)
					impos = True
					isPos = True
					break
			if isPos:
				break
		if not impos:
			print(-1)


q = int(input())
for _ in range(q):
	n = int(input())
	A = list(map(int, input().split()))
	ref = A[0] + A[1]
	ans = 0
	for (i, a) in enumerate(A):
		if a >= ref:
			ans = i
			break
	if ans == 0:
		print(-1)
	else:
		print(1, 2, ans + 1)


t = int(input())
while t > 0:
	n = int(input())
	a = [int(x) for x in input().split()]
	c = 1
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
		c = 0
	if c:
		print(-1)
	t -= 1


import sys
input = sys.stdin.readline

def prog():
	for _ in range(int(input())):
		n = int(input())
		a = list(map(int, input().split()))
		worked = False
		ans = []
		if a[0] + a[1] <= a[n - 1]:
			print(1, 2, n)
		else:
			print(-1)
prog()


import sys
import math
from collections import Counter, defaultdict
input = sys.stdin.readline
LI = lambda : list(map(int, input().split()))
MAP = lambda : map(int, input().split())
IN = lambda : int(input())
S = lambda : input()

def case():
	n = IN()
	a = LI()
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)
for _ in range(IN()):
	case()


import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
ALPHA = 'abcdefghijklmnopqrstuvwxyz'
M = 10 ** 9 + 7
EPS = 1e-06

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
for _ in range(Int()):
	n = Int()
	a = array()
	x = a[0]
	y = a[1]
	z = a[-1]
	if x + y <= z:
		print(1, 2, n)
	else:
		print(-1)


import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(x) for x in input().split()]
	if arr[0] + arr[1] <= arr[n - 1]:
		print('{} {} {}'.format(1, 2, n))
	else:
		print(-1)


for test in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, n)


for I in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	temp = a[0] + a[1]
	res = -1
	for i in range(2, n):
		if a[i] >= temp:
			res = i + 1
			break
	if res == -1:
		print(res)
	else:
		print(1, 2, res)


try:
	t = int(input())
	for _ in range(t):
		n = int(input())
		flag = 0
		a = list(map(int, input().split()))
		if a[-1] >= a[0] + a[1]:
			print(1, 2, n)
		else:
			print(-1)
except:
	pass


from functools import reduce
from collections import Counter
import time
import datetime

def time_t():
	print('Current date and time: ', datetime.datetime.now())
	print('Current year: ', datetime.date.today().strftime('%Y'))
	print('Month of year: ', datetime.date.today().strftime('%B'))
	print('Week number of the year: ', datetime.date.today().strftime('%W'))
	print('Weekday of the week: ', datetime.date.today().strftime('%w'))
	print('Day of year: ', datetime.date.today().strftime('%j'))
	print('Day of the month : ', datetime.date.today().strftime('%d'))
	print('Day of week: ', datetime.date.today().strftime('%A'))

def ip():
	return int(input())

def sip():
	return input()

def mip():
	return map(int, input().split())

def mips():
	return map(str, input().split())

def lip():
	return list(map(int, input().split()))

def matip(n, m):
	lst = []
	for i in range(n):
		arr = lip()
		lst.append(arr)
	return lst

def factors(n):
	return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def minJumps(arr, n):
	jumps = [0 for i in range(n)]
	if n == 0 or arr[0] == 0:
		return float('inf')
	jumps[0] = 0
	for i in range(1, n):
		jumps[i] = float('inf')
		for j in range(i):
			if i <= j + arr[j] and jumps[j] != float('inf'):
				jumps[i] = min(jumps[i], jumps[j] + 1)
				break
	return jumps[n - 1]

def dic(arr):
	return Counter(arr)
t = ip()
while t:
	t -= 1
	n = ip()
	arr = lip()
	k = 0
	j = 1
	a = arr[k]
	b = arr[j]
	flag = 0
	for i in range(2, n):
		if a + b <= arr[i]:
			print(1, 2, i + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


t1 = int(input())
for i in range(t1):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[n - 1]:
		print('1 2 %s' % n)
	else:
		print(-1)


from random import randint
t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(j) for j in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


def main():
	t = int(input())
	for i in range(t):
		n = int(input())
		a = [int(x) for x in input().split()]
		if a[0] + a[1] <= a[-1]:
			print(1, 2, n)
		else:
			print(-1)
main()


def main():
	test_case = int(input())
	for i in range(test_case):
		n = int(input())
		lst = list(map(int, input().split()))
		if lst[0] + lst[1] <= lst[n - 1]:
			print('{0} {1} {2}'.format(1, 2, n))
		else:
			print('-1')
main()


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	t = l[0] + l[1]
	flag = 0
	for i in range(2, n):
		if l[i] >= t:
			flag = 1
			c = i
			break
	if flag:
		print(1, 2, c + 1)
	else:
		print(-1)


import sys
input = sys.stdin.readline

def inInt():
	return int(input())

def inStr():
	return input().strip('\n')

def inIList():
	return list(map(int, input().split()))

def inSList():
	return input().split()

def solve(n, l):
	if l[0] + l[1] <= l[n - 1]:
		print('%s %s %s' % (1, 2, n))
	else:
		print(-1)
tests = inInt()
for t in range(tests):
	n = inInt()
	l = inIList()
	solve(n, l)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	result = False
	for i in range(n - 1):
		if arr[i] + arr[i + 1] <= arr[n - 1]:
			print(i + 1, i + 2, n)
			result = True
			break
	if result == False:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	flag = True
	temp = a[0] + a[1]
	x = 1
	y = 2
	for i in range(2, n):
		if temp <= a[i]:
			print(x, y, i + 1)
			flag = False
			break
	if flag:
		print(-1)


import bisect
t = int(input())
for _ in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	if A[-1] >= A[0] + A[1]:
		print(1, 2, n)
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	L = list(map(int, input().split()))
	if L[n - 1] >= L[0] + L[1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())

def fn():
	n = int(input())
	l = list(map(int, input().split()))
	i = 0
	j = 1
	k = n - 1
	while i < j < k:
		if l[i] + l[j] > l[k]:
			i += 1
			j += 1
		else:
			return [i + 1, j + 1, k + 1]
	return [-1]
while t:
	print(*fn())
	t -= 1


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	i = 0
	j = 1
	k = 2
	f = 0
	while k < n:
		if l[i] + l[j] <= l[k]:
			print(i + 1, j + 1, k + 1)
			f = 1
			break
		else:
			k += 1
	if f == 0:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list((int(num) for num in input().split()))
	ans = [1, 2, n]
	if a[0] + a[1] > a[n - 1]:
		print('-1')
	else:
		print(*ans)


t = int(input())
for _ in range(t):
	n = int(input())
	x = list(map(int, input().split()))
	f = 0
	l = x[-1]
	for i in range(n - 1):
		if x[i] + x[i + 1] <= l:
			print(i + 1, i + 2, n)
			f = -1
			break
	if f == 0:
		print(-1)


import sys
from os import path
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def solve():
	n = int(input().strip())
	a = [int(i) for i in input().rstrip().split()]
	if a[-1] - a[0] - a[1] >= 0:
		print(f'1 2 {n}')
	else:
		print(-1)

def main():
	tc = int(input().strip())
	for case in range(tc):
		solve()
main()


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
from decimal import Decimal
mod = pow(10, 9) + 7
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(var):
	sys.stdout.write(str(var) + '\n')

def outa(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
for _ in range(int(data())):
	n = int(data())
	arr = l()
	if arr[0] + arr[1] <= arr[-1]:
		outa(1, 2, n)
		continue
	out(-1)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
inp = lambda : sys.stdin.readline().rstrip('\r\n')
inin = lambda : int(inp())
inar = lambda : list(map(int, inp().split()))
inst = lambda : inp().decode().strip()
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


import math
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	(a, b) = (arr[0], arr[1])
	c = -1
	for i in range(2, n):
		if arr[i] >= a + b:
			c = i + 1
			break
	if c != -1:
		print(1, 2, c)
	else:
		print(-1)


import sys
max_int = 1000000001
min_int = -max_int
t = int(input())
for _t in range(t):
	n = int(sys.stdin.readline())
	a = list(map(int, sys.stdin.readline().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


l = []
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		l.append(-1)
	else:
		l.append(f'{1} {2} {len(a)}')
for i in l:
	print(i)


from math import *
from collections import *
from random import *
from decimal import Decimal
from heapq import *
from bisect import *
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 5)

def lis():
	return list(map(int, input().split()))

def ma():
	return map(int, input().split())

def inp():
	return int(input())

def st1():
	return input().rstrip('\n')
t = inp()
while t:
	t -= 1
	n = inp()
	a = lis()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


import io
import os
import sys
from collections import deque, defaultdict
from itertools import accumulate
inf = 1 << 65

def _input():
	x = sys.stdin.readline()
	x = x.replace('\r', '')
	x = x.replace('\n', '')
	return x
if 'STDINPUT' not in os.environ:
	input = _input
else:
	print('Standard input')

def solve():
	n = int(input())
	a = [int(x) for x in input().split()]
	(x, y, c) = (a[0], a[1], a[-1])
	if x + y <= c:
		print(1, 2, n)
	else:
		print(-1)
test_cases = True
if test_cases:
	_q = int(input())
	for _ in range(_q):
		solve()
else:
	solve()


t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	(x, y, z) = (l[0], l[-1], l[1])
	if y >= x + z:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	x = a[0]
	y = a[1]
	found = False
	for i in range(n - 2):
		z = a[2 + i]
		if x + y <= z:
			found = True
			print(1, 2, i + 3)
			break
	if not found:
		print(-1)


import sys
T = int(sys.stdin.readline().strip())
for t in range(0, T):
	n = int(sys.stdin.readline().strip())
	a = list(map(int, sys.stdin.readline().strip().split()))
	b = [[a[i], i + 1] for i in range(0, n)]
	if b[0][0] + b[1][0] <= b[-1][0]:
		print(b[0][1], b[1][1], b[-1][1])
	else:
		print(-1)


for i in range(int(input())):
	s = input()
	x = list(map(int, input().split()))
	if x[0] + x[1] <= x[-1]:
		print(1, 2, len(x), sep=' ')
	else:
		print(-1)


num_cases = int(input())
for i in range(num_cases):
	length = int(input())
	integers = list(map(int, input().split()))
	if integers[0] + integers[1] > integers[-1]:
		print(-1)
	else:
		print(1, 2, length)


for _ in range(int(input())):
	k = int(input())
	l = list(map(int, input().split()))
	a = 0
	v = l[0] + l[1]
	for i in range(2, len(l)):
		if v <= l[i]:
			z = i + 1
			a = 1
			break
	if a == 1:
		print(1, 2, z)
	else:
		print(-1)


t = int(input())
for test in range(t):
	n = int(input())
	nums = [int(x) for x in input().split()]
	first = nums[0] + nums[1]
	if first <= nums[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	input()
	lst = list(map(int, input().split()))
	if lst[0] + lst[1] <= lst[-1]:
		print(1, 2, len(lst))
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	list1 = list((int(n) for n in input().split()))
	if list1[0] + list1[1] <= list1[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	li = list(map(int, input().split()))
	a = li[0]
	b = li[1]
	c = a + b
	fg = 0
	d = 0
	for i in range(2, n):
		if c <= li[i]:
			fg = 1
			d = i + 1
			break
	if fg == 0:
		print(-1)
	else:
		print(1, 2, d)


testcases = int(input())
for testcase in range(testcases):
	n = int(input())
	temparr = input()
	temparr = temparr.split()
	arr = []
	for i in temparr:
		arr.append(int(i))
	l1 = 0
	l2 = 1
	l3 = n - 1
	flag = 0
	if arr[l1] + arr[l2] <= arr[l3]:
		flag = 1
	if flag == 0:
		print(-1)
	else:
		print('1 2 ' + str(n))


import os
inp = os.read(0, os.fstat(0).st_size).split(b'\n')
_ii = -1

def rdln():
	global _ii
	_ii += 1
	return inp[_ii]
inin = lambda typ=int: typ(rdln())
inar = lambda typ=int: [typ(x) for x in rdln().split()]
inst = lambda : rdln().strip().decode()
_DEBUG = 0

def debug(*args):
	if _DEBUG:
		import inspect
		frame = inspect.currentframe()
		frame = inspect.getouterframes(frame)[1]
		string = inspect.getframeinfo(frame[0]).code_context[0].strip()
		arns = string[string.find('(') + 1:-1].split(',')
		print('.#debug:', end=' ')
		for (i, j) in zip(arns, args):
			print(i, ' = ', j, end=', ')
		print()
_T_ = inin()
for _t_ in range(_T_):
	debug(_t_)
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


def check(n):
	i = 0
	mi = n[2]
	ma = n[-1]
	while i <= len(n) - 3:
		a = n[i]
		b = n[i + 1]
		c = n[i + 2]
		if a + b <= ma:
			return [i, i + 1, len(n) - 1]
		elif a + b <= c:
			return [i, i + 1, i + 2]
		i += 1
	return [-1]
for _ in range(int(input())):
	k = int(input())
	l = list(map(int, input().split(' ')))
	o = check(l)
	if len(o) == 1:
		print(-1)
	else:
		for k in o:
			print(k + 1, end=' ')
		print()


test = int(input())
for _ in range(test):
	n = int(input())
	arr = list(map(int, input().split()))
	t = arr[0] + arr[1]
	o = arr[-1]
	if t <= o:
		print(1, end=' ')
		print(2, end=' ')
		print(n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = [int(v) for v in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for j in range(t):
	n = int(input())
	list1 = list(map(int, input().split(' ')))
	a = 0
	b = 1
	ct = 0
	for i in range(2, n):
		if list1[i] >= list1[a] + list1[b]:
			print(a + 1, b + 1, i + 1)
			ct += 1
			break
	if not ct:
		print(-1)


def badtri(arr):
	last = arr[-1]
	for i in range(len(arr) - 2):
		diff = last - arr[i]
		if arr[i + 1] <= diff:
			return (i + 1, i + 2, len(arr))
	return (-1,)
t = int(input())
for i in range(t):
	n = int(input())
	arr = [int(k) for k in input().split()]
	print(*badtri(arr))


t = int(input())
for i in range(t):
	n = int(input())
	x = [int(x) for x in input().split()]
	if x[0] + x[1] <= x[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


n = int(input())
for i in range(n):
	m = int(input())
	s = input().split(' ')
	a = []
	for c in s:
		a.append(int(c))
	a.sort()
	if a[len(a) - 1] >= a[0] + a[1]:
		print(1, 2, len(a))
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	ok = 0
	check = arr[0] + arr[1]
	if check <= arr[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
input = sys.stdin.readline
ins = lambda : input().rstrip()
ini = lambda : int(input().rstrip())
inm = lambda : map(int, input().split())
inl = lambda : list(map(int, input().split()))
ans = []
t = ini()
for _ in range(t):
	n = ini()
	a = inl()
	if a[0] + a[1] <= a[n - 1]:
		ans.append(f'{1} {2} {n}')
	else:
		ans.append('-1')
print('\n'.join(ans))


def read_int():
	return int(input().strip())

def read_ints():
	return list(map(int, input().strip().split(' ')))

def solve():
	N = read_int()
	A = read_ints()
	if A[0] + A[1] <= A[-1]:
		return (1, 2, N)
	return [-1]
T = read_int()
for _ in range(T):
	print(*solve())


t = int(input())
for i in range(0, t):
	m = int(input())
	arr1 = list(map(int, input().strip().split()))[:m]
	l1 = []
	ct = 0
	for i in range(0, m - 2):
		if arr1[i] + arr1[i + 1] <= arr1[-1]:
			l1.append(i + 1)
			l1.append(i + 2)
			l1.append(m)
			print(*l1, sep=' ')
			ct += 1
			break
	if ct == 0:
		print('-1')


tc = int(input())
for _ in range(tc):
	n = int(input())
	a = list(map(int, input().split()))
	(i, j, k) = (0, 1, n - 1)
	if a[i] + a[j] <= a[k]:
		print(i + 1, j + 1, k + 1)
	else:
		print(-1)


N = int(input())
LIS = [0 for i in range(N)]
for j in range(N):
	x = int(input())
	listik = [int(i) for i in input().split()]
	if listik[0] + listik[1] <= listik[x - 1]:
		LIS[j] = [1, 2, x]
	else:
		LIS[j] = [-1]
for lis in LIS:
	lis = [str(i) for i in lis]
	print(' '.join(lis))


cases = int(input())
for i in range(cases):
	n = int(input())
	line2 = input().split(' ')
	arr = []
	for a in line2:
		arr.append(int(a))
	mi = arr[0]
	pos = False
	for j in range(1, n):
		s = mi + arr[j]
		if s <= arr[-1]:
			print(1, j + 1, n)
			pos = True
			break
	if not pos:
		print(-1)


for xyz in range(0, int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


import bisect

def multiple_input():
	return map(int, input().split())

def list_input():
	return list(map(int, input().split()))
for _ in range(int(input())):
	n = int(input())
	a = list_input()
	s = a[0] + a[1]
	x = a[-1]
	if s > x:
		print(-1)
	else:
		print(1, 2, n)


from math import sqrt
t = int(input())

def area(a, b, c):
	p = (a + b + c) / 2
	area = sqrt(p * (p - a) * (p - b) * (p - c))
	return area
while t:
	n = int(input())
	a = [int(x) for x in input().split()]
	flag = 0
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)
	t -= 1


from collections import defaultdict
import copy

def ii():
	return int(input())

def si():
	return input()

def li():
	return list(map(int, input().split()))

def mi():
	return map(int, input().split())
t = ii()
for _ in range(t):
	n = ii()
	arr = li()
	flag = False
	a = arr[0]
	b = arr[1]
	for i in range(n - 1, 1, -1):
		if a + b <= arr[i]:
			print(1, 2, i + 1)
			flag = True
			break
	if flag == False:
		print(-1)


k = lambda : map(int, input().split())
for _ in range(int(input())):
	n = input()
	a = list(k())
	print(-1 if a[0] + a[1] > a[-1] else '1 2 ' + str(n))


T = int(input())
for t in range(T):
	n = int(input())
	L = list(map(int, input().split()))
	b = 0
	d = L[n - 1] - L[0]
	for i in range(1, n):
		if L[i] <= d:
			print(str(1) + ' ' + str(i + 1) + ' ' + str(n))
			b = 1
			break
	if b == 0:
		print('-1')


for item in range(int(input())):
	input()
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, len(a))
	else:
		print('-1')


t = int(input())
for _ in range(t):
	n = int(input())
	ar = [int(i) for i in input().strip().split(' ')]
	a = ar[0]
	b = ar[1]
	c = ar[-1]
	if a + b > c:
		print(-1)
	else:
		print(1, 2, n)


for i in range(int(input())):
	a = int(input())
	b = list(map(int, input().split()))
	c = b[0] + b[1]
	d = True
	for j in range(2, a):
		if b[j] >= c:
			d = False
			break
	if d == False:
		print(1, 2, j + 1)
	else:
		print(-1)


def solve(n, a):
	i = 0
	j = 1
	for idx in range(2, n):
		c = a[idx]
		if c + a[i] <= a[j] or c + a[j] <= a[i] or a[i] + a[j] <= c:
			c = idx
			print(i + 1, j + 1, idx + 1)
			return
	print(-1)
t = int(input())
for test in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	solve(n, a)


def triangle(a, b, c):
	if a + b > c and b + c > a and (a + c > b):
		return True
	else:
		return False
for _ in range(int(input())):
	a = int(input())
	b = list((int(x) for x in input().split()))
	if triangle(b[0], b[1], b[-1]) == False:
		print(1, 2, a)
	else:
		print(-1)


def deg(arr):
	ma = arr[-1]
	if arr[0] + arr[1] > ma:
		return -1
	else:
		return (1, 2, len(arr))
t = int(input())
for i in range(t):
	n = int(input())
	arr1 = [int(k) for k in input().split()]
	t = deg(arr1)
	if t == -1:
		print(-1)
	else:
		print(t[0], t[1], t[2])


def main():
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] <= arr[n - 1]:
		print('1 2 {}'.format(n))
	else:
		print('-1')
for _ in range(int(input())):
	main()


import sys, math

def pr(a, b, c):
	if a + b > c and a + c > b and (c + b > a):
		return True
	return False
for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	(f, t) = (a[0], a[1])
	ans = True
	for i in range(2, n):
		if not pr(f, t, a[i]):
			ans = False
			print(1, 2, i + 1)
			break
	if ans:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	ar = list(map(int, input().split()))
	flg = 0
	x = ar[0]
	y = ar[1]
	z = ar[n - 1]
	if x + y <= z:
		print(1, 2, n)
	else:
		print(-1)


import math
import sys
import re
n = int(input())
for x in range(n):
	l = int(input())
	a = list(map(int, input().rstrip().split()))
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, l)


for _ in range(int(input())):
	le = int(input())
	(f, s, *_, la) = [int(i) for i in input().split()]
	print(1, 2, le) if f + s <= la else print(-1)


t = int(input())
for _ in range(t):
	l = int(input())
	a = list(map(int, input().strip().split()))
	if l < 3:
		print(-1)
		continue
	if a[0] + a[1] <= a[l - 1]:
		print('{0} {1} {2}'.format(1, 2, l))
	else:
		print(-1)


def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		a = list(map(int, input().strip().split()))
		if a[0] + a[1] <= a[-1]:
			print('1 2', n)
		else:
			print(-1)
main()


t = input()
t = int(t)

def solve(n, arr):
	a1 = arr[0]
	a2 = arr[1]
	for i in range(2, n):
		if a1 + a2 <= arr[i]:
			print(1, 2, i + 1)
			return
	print(-1)
	return
for i in range(t):
	n = input()
	n = int(n)
	arr = list(map(int, input().split()))
	solve(n, arr)


t = int(input())
for i in range(t):
	n = int(input())
	nums = list(map(lambda x: int(x), input().split()))
	if nums[0] + nums[1] <= nums[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import random

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def lcm(a, b):
	return a * b / gcd(a, b)
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	f = a[0]
	s = -1
	t = a[n - 1]
	for i in range(1, n - 1):
		if a[i] + f <= t:
			s = i
			break
	if s == -1:
		print(-1)
	else:
		print(1, s + 1, n)


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	l = list(map(int, input().split()))
	k = 0
	if l[0] + l[1] <= l[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


n = int(input())
for i in range(n):
	y = int(input())
	a = list(map(int, input().split()))
	p = 0
	q = 0
	for k in range(2, y):
		if a[0] + a[1] <= a[k]:
			p = 1
			q = k + 1
			break
	if p == 0:
		print(-1)
	else:
		print(p, p + 1, q)


import sys

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s)
	sys.stdout.write('\n')

def wi(n):
	sys.stdout.write(str(n))
	sys.stdout.write('\n')

def wia(a, sep=' '):
	sys.stdout.write(sep.join([str(x) for x in a]))
	sys.stdout.write('\n')

def solve(n, a):
	if a[0] + a[1] <= a[n - 1]:
		return [1, 2, n]
	return [-1]

def main():
	for _ in range(ri()):
		n = ri()
		a = ria()
		wia(solve(n, a))
main()


t = int(input())
while t > 0:
	t = t - 1
	n = int(input())
	a = input().split()
	x = int(a[0])
	y = int(a[1])
	z = int(a[n - 1])
	if x + y <= z:
		print(1, 2, n)
	else:
		print(-1)


import math

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b / gcd(a, b)

def bs(arr, l, r, x):
	while l <= r:
		mid = l + (r - l) // 2
		if arr[mid] == x:
			return arr[mid]
		elif arr[mid] < x:
			l = mid + 1
		else:
			r = mid - 1
	return -1

def swap(list, pos1, pos2):
	(list[pos1], list[pos2]) = (list[pos2], list[pos1])
	return list

def subarrayBitwiseOR(A):
	res = set()
	pre = {0}
	for x in A:
		pre = {x | y for y in pre} | {x}
		res |= pre
	return len(res)
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	x = a[0]
	y = a[1]
	for i in range(2, n):
		z = a[i]
		if x + y <= z or y + z <= x or z + x <= y:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


T = int(input())
for _ in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	if A[1] + A[0] <= A[-1]:
		print(1, 2, N)
	else:
		print(-1)


t = int(input())
answer = [0] * t
for i in range(t):
	s = int(input())
	a = [int(i) for i in input().split()]
	if a[0] + a[1] <= a[-1]:
		answer[i] = '1 2 ' + str(s)
	else:
		answer[i] = -1
for i in range(t):
	print(answer[i])


from sys import stdin, stdout
input = stdin.readline
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	b = [(a[i], i + 1) for i in range(len(a))]
	b.sort(key=lambda x: x[0])
	if b[0][0] + b[1][0] <= b[-1][0]:
		t = (b[0][1], b[1][1], b[-1][1])
		print(*sorted(t), sep=' ')
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	arr = [int(item) for item in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


while True:
	try:
		t = eval(input())
		for i in range(t):
			n = eval(input())
			list0 = list(map(int, input().split()))
			if list0[0] + list0[1] <= list0[n - 1]:
				print(1, 2, n)
			else:
				print(-1)
	except:
		break


t = int(input())
while t:
	n = int(input())
	a = [int(i) for i in input().split()]
	if a[0] + a[1] <= a[len(a) - 1]:
		print(1, 2, len(a))
	else:
		print(-1)
	t -= 1


test = int(input())
for t in range(0, test):
	n = int(input())
	lst = [int(x) for x in input().split()]
	if lst[n - 1] >= lst[0] + lst[1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for case in range(t):
	n = int(input())
	arr = [*map(int, input().split())]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


T = int(input())

def ans(A):
	A = [(a, i + 1) for (i, a) in enumerate(A)]
	A = sorted(A)
	(a, ai) = A[0]
	(b, bi) = A[1]
	(c, ci) = A[-1]
	if a + b <= c:
		print(ai, bi, ci)
	else:
		print(-1)
for t in range(T):
	input()
	A = list(map(int, input().split()))
	ans(A)


def bins(lo, hi, a, val):
	while lo < hi:
		mid = (lo + hi) // 2
		if val <= a[mid]:
			return mid
		else:
			lo = mid + 1
	return lo
t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	chk = 1
	s = arr[0] + arr[1]
	idx = bins(2, n - 1, arr, s)
	ss = arr[idx]
	if s <= ss:
		print(1, 2, idx + 1)
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()][:n]
	s = a[0] + a[1]
	if s > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
n = []
sides = []
for _ in range(t):
	n.append(int(input()))
	sides.append(list(map(int, input().split())))
for te in range(t):
	found = 0
	if sides[te][0] + sides[te][1] <= sides[te][n[te] - 1]:
		print(1, 2, n[te])
		found = 1
	if not found:
		print(-1)


from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
input = stdin.readline
for __ in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	x = 0
	y = n - 1
	ans = []
	while x + 1 < y:
		if ar[x] + ar[x + 1] <= ar[y]:
			ans = [x + 1, x + 2, y + 1]
			break
		x += 1
		y -= 1
	if len(ans) == 0:
		print(-1)
	else:
		print(*ans)


def Solution(arr):
	if not arr[0] + arr[1] > arr[-1]:
		return str(1) + ' ' + str(2) + ' ' + str(len(arr))
	else:
		return -1
t = int(input())
for _ in range(t):
	__ = input()
	arr = list(map(int, input().split(' ')))
	print(Solution(arr))


t = int(input())
for test in range(0, t):
	n = int(input())
	a = list(map(int, input().rstrip().split()))
	ai = a[0]
	aj = a[1]
	ak = a[n - 1]
	if ai + aj > ak:
		print('-1\n')
	else:
		print('%d %d %d\n' % (1, 2, n))


n = int(input())
for i in range(n):
	flag = 0
	m = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, m)
	else:
		print(-1)


t = int(input())
for z in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	min = arr[0] + arr[1]
	pos = True
	for i in range(2, n):
		if arr[i] >= min:
			pos = False
			posf = i
			break
	if pos:
		print('-1')
	else:
		print('1 2', posf + 1)


def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
		return
	print(-1)
for i in range(int(input())):
	solve()


def main(case):
	n = int(input())
	lst = list(map(int, input().split()))
	if lst[0] + lst[1] <= lst[-1]:
		print(1, 2, n)
		return
	print(-1)
t = int(input())
for i in range(t):
	main(i + 1)


for _ in range(int(input())):
	m = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, m)


T = int(input())
for _ in range(T):
	input()
	l = list(map(int, input().split()))
	for i in range(len(l)):
		l[i] = (l[i], i)
	l.sort()
	if l[0][0] + l[1][0] <= l[-1][0]:
		print(l[0][1] + 1, l[1][1] + 1, l[-1][1] + 1)
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	A = list(map(int, input().split()))
	ans = []
	if abs(A[0] - A[n - 1]) >= A[1]:
		ans.append(1)
		ans.append(2)
		ans.append(n)
	elif A[0] >= A[n - 1] + A[n - 2]:
		ans.append(1)
		ans.append(n - 1)
		ans.append(n)
	else:
		ans.append(-1)
	print(' '.join(map(str, ans)))


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	x = a[0]
	y = a[1]
	z = a[-1]
	c = len(a)
	if x + y > z:
		print(-1)
	else:
		print(1, 2, c)


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
				continue
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
		return to
	return wrapped_func
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def solve():
	n = int(inp())
	a = lis()
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
		return
	print(-1)
testcase(int(inp()))


def solve(n, a):
	(a, b, c) = (a[0], a[1], a[-1])
	if a + b > c:
		print(-1)
	else:
		print(1, 2, n)
	return

def main():
	inp = lambda : [int(x) for x in input().split()]
	tc = int(input())
	for _ in range(tc):
		(n, a) = (int(input()), inp())
		solve(n, a)
main()


def algo(a, N):
	if a[0] + a[1] <= a[-1]:
		s = '1' + ' ' + '2' + ' ' + str(n)
		return s
	return -1
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	print(algo(a, n))


try:
	t = int(input())
	for i in range(t):
		n = int(input())
		l = list(map(int, input().split()))
		a = l[0]
		b = l[1]
		v = 2
		for i in range(2, n):
			if l[i] >= a + b:
				c = i + 1
				break
			else:
				v += 1
		if v == n:
			print(-1)
		else:
			print(1, 2, c)
except:
	pass


for _ in range(int(input())):
	n = int(input())
	b = list(map(int, input().split()))
	ans = False
	for i in range(2, len(b)):
		if b[0] + b[1] <= b[i]:
			ans = True
			print(1, 2, i + 1)
			break
	if ans == False:
		print(-1)


import sys
inp = sys.stdin.buffer.readline
read = lambda : [int(x) for x in inp().split()]
input = lambda : inp().decode().strip()
(_T_,) = read()
for _t_ in range(_T_):
	(n,) = read()
	a = read()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


def function(n, nums):
	if nums[0] + nums[1] <= nums[-1]:
		return f'{1} {2} {len(nums)}'
	else:
		return -1
t = int(input())
for k in range(t):
	n = int(input())
	nums = list(map(int, input().rstrip().split()))
	print(function(n, nums))


for i in range(int(input())):
	n = int(input())
	a = sorted(map(int, input().split()))
	print('1 2 %d' % n if a[0] + a[1] <= a[n - 1] else -1)


import sys
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda : list(map(int, input().strip().split()))

def main():
	for _ in range(int(input())):
		n = int(input())
		arr = read()
		if arr[0] + arr[1] <= arr[-1]:
			print(1, 2, n)
		else:
			print(-1)
main()


for test in range(int(input())):
	n = int(input())
	l = list(map(int, input().strip().split(' ')))
	if l[-1] >= l[0] + l[1]:
		print(1, 2, n)
	else:
		print(-1)


def calc(n, A):
	f = A[0]
	l = A[1]
	bool = False
	for i in range(2, n):
		if A[i] >= f + l:
			print(1, 2, i + 1)
			bool = True
			break
	if bool is False:
		print(-1)
for _ in range(int(input())):
	n = int(input())
	A = list((int(i) for i in input().split()))
	calc(n, A)


for t in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	c = l[n - 1]
	b = l[1]
	a = l[0]
	if a + b <= c or b + c <= a or c + a <= b:
		print(1, 2, n)
	else:
		print(-1)


for t in range(int(input())):
	n = int(input())
	arr = [int(k) for k in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	min_sum = l[0] + l[1]
	third_index = 0
	for i in range(n):
		if l[i] >= min_sum:
			third_index = i + 1
			break
	if third_index:
		print(1, 2, third_index)
	else:
		print(-1)


t = int(input())
for l in range(t):
	n = int(input())
	ar = list(map(int, input().strip().split()))
	if ar[0] + ar[1] <= ar[-1]:
		print(1, 2, len(ar))
	else:
		print(-1)


import sys
import math
from collections import defaultdict, Counter
t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for q in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] <= l[-1]:
		print('1 2', n)
	else:
		print('-1')


def Solve():
	Result = []
	c = 0
	if Arr[c] + Arr[c + 1] > Arr[-1]:
		Result.append(-1)
		return Result
	else:
		Result.append(c + 1)
		Result.append(c + 2)
		Result.append(ArrSize)
		return Result
TestCases = int(input(''))
Results = []
for c in range(TestCases):
	ArrSize = int(input(''))
	Arr = list(map(int, input().split()))
	Results.append(Solve())
for c in Results:
	for i in range(len(c)):
		print(c[i], end=' ')
	print('')


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	sum = a[0] + a[1]
	print(f'1 2 {n}') if sum <= a[-1] else print(-1)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	f = 0
	(a, b) = (l[0], l[1])
	for i in range(2, n):
		if a + b <= l[i]:
			f = 1
			break
	if f == 1:
		print(1, 2, i + 1)
	else:
		print(-1)


t = int(input())
while t > 0:
	n = int(input())
	arr = list(map(int, input().split()))
	flag = True
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, n)
	t -= 1


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	find = False
	x = a[0]
	z = a[-1]
	for i in range(1, n - 1):
		y = a[i]
		if x + y <= z:
			find = True
			break
	if find:
		print(1, i + 1, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	list1 = [int(i) for i in input().split()]
	try:
		if list1[0] + list1[1] <= list1[-1]:
			print(1, 2, n)
		else:
			print(-1)
	except:
		print(-1)


import sys
LI = lambda : list(map(int, sys.stdin.readline().strip('\n').split()))
MI = lambda : map(int, sys.stdin.readline().strip('\n').split())
SI = lambda : sys.stdin.readline().strip('\n')
II = lambda : int(sys.stdin.readline().strip('\n'))
for _ in range(II()):
	n = II()
	a = LI()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


from sys import stdin
tt = int(stdin.readline())
for loop in range(tt):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().split()))
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


n = int(input().strip())
printing = []
for test in range(n):
	m = input()
	a = input().strip().split(' ')
	b = []
	for c in a:
		b.append(int(c))
	b.sort()
	if int(b[0]) + int(b[1]) <= int(b[-1]):
		d = []
		d.append(a.index(str(b[0])) + 1)
		d.append(a.index(str(b[1])) + 1)
		count = 0
		while d[1] == d[0]:
			a[int(d[0]) - 1] = -1
			d[1] = a.index(str(b[1])) + 1
		d.append(a.index(str(b[-1])) + 1)
		d.sort()
		printing.append(' '.join(map(str, d)))
	else:
		printing.append('-1')
for item in printing:
	print(item)


def solve():
	n = int(input())
	arr = [int(i) for i in input().split()]
	arr.sort()
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
		return
	print(-1)
test = int(input())
while test:
	solve()
	test -= 1


for _ in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	minimum = min(a)
	ind = a.index(minimum)
	nexus = a[ind]
	a[ind] = -1
	maximum = max(a)
	a[ind] = float('inf')
	minimum2 = min(a)
	ind2 = a.index(minimum2)
	ind3 = a.index(maximum)
	a[ind] = nexus
	if a[ind] + a[ind2] <= a[ind3]:
		print(ind + 1, ind2 + 1, ind3 + 1)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	p = (arr[0] + arr[1] + arr[n - 1]) / 2
	if p > arr[0] and p > arr[1] and (p > arr[n - 1]):
		print(-1)
	else:
		print('1 2', n)


t = int(input())
for you in range(t):
	n = int(input())
	l = input().split()
	li = [int(i) for i in l]
	if li[0] + li[1] <= li[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	print('-1' if arr[0] + arr[1] > arr[n - 1] else f'1 2 {n}')


def no_triangle(arr):
	arr.sort()
	if arr[0] + arr[1] <= arr[-1]:
		l = [1, 2, len(arr)]
	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)


import sys

def input():
	return sys.stdin.readline().rstrip()

def input_split():
	return [int(i) for i in input().split()]
testCases = int(input())
answers = []
for _ in range(testCases):
	n = int(input())
	arr = input_split()
	(x, y, z) = (arr[0], arr[1], arr[-1])
	if x + y > z:
		ans = -1
	else:
		ans = '1 2 {}'.format(n)
	answers.append(ans)
print(*answers, sep='\n')


t = int(input())
a = b = c = 0
for i in range(t):
	f = 0
	n = int(input())
	li = list(map(int, input().split()))[:n]
	if li[0] + li[1] <= li[len(li) - 1]:
		print(1, 2, len(li))
	else:
		print(-1)


import sys
input = lambda : sys.stdin.readline().strip()
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, len(a))
	else:
		print(-1)


for _ in range(int(input())):
	input()
	arr = [int(x) for x in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, len(arr))
	else:
		print(-1)


import sys
sys.setrecursionlimit(10 ** 5)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep='\n')

def II():
	return int(sys.stdin.readline())

def MI():
	return map(int, sys.stdin.readline().split())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number):
	return [LI() for _ in range(rows_number)]

def SI():
	return sys.stdin.readline()[:-1]
for _ in range(II()):
	n = II()
	aa = LI()
	if aa[0] + aa[1] > aa[-1]:
		print(-1)
	else:
		print(1, 2, n)


for query in range(int(input())):
	n = int(input())
	b = input().split()
	a = []
	for x in range(n):
		a.append((int(b[x]), x + 1))
	a = sorted(a)
	if a[0][0] + a[1][0] <= a[n - 1][0]:
		print(str(a[0][1]) + ' ' + str(a[1][1]) + ' ' + str(a[n - 1][1]))
	else:
		print(-1)


t = int(input())

def solve():
	n = int(input())
	arr = list(map(int, input().split()))
	maximum = arr[-1]
	minimum = arr[0]
	second = arr[1]
	if minimum + second <= maximum:
		print(1, 2, len(arr))
	else:
		print(-1)
for i in range(t):
	solve()


for _ in range(int(input())):
	n = int(input())
	l = [int(j) for j in input().split()]
	c = l[0] + l[1]
	f = 0
	for i in range(2, n):
		if c <= l[i]:
			print(1, 2, i + 1)
			f = 1
			break
	if f == 0:
		print(-1)


t = int(input())
ans = []
for i in range(t):
	n = int(input())
	d = [int(i) for i in input().split()]
	q = 1
	(x, y) = (d[0], d[1])
	for j in range(2, n):
		if x + y <= d[j]:
			ans.append((1, 2, j + 1))
			q = 0
			break
	if q != 0:
		ans.append(-1)
for i in ans:
	if i != -1:
		print(i[0], i[1], i[2])
	else:
		print(i)


t = int(input())
for _ in range(0, t):
	n = int(input())
	a = [int(i) for i in input().split()]
	(aa, bb, cc) = (a[0], a[1], a[-1])
	if aa + bb > cc and aa + cc > bb and (bb + cc > aa):
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(num) for num in input().split(' ')]
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, end=' ')
		print(2, end=' ')
		print(n)


def solve(n, arr):
	if arr[0] + arr[1] > arr[n - 1]:
		return -1
	else:
		return '1 2 ' + str(n)
t = int(input())
results = list()
for _ in range(0, t):
	n = int(input())
	arr = list(map(int, input().split(' ')))
	results.append(solve(n, arr))
for result in results:
	print(result)


for _ in range(int(input())):
	N = int(input())
	a = list(map(int, input().split()))
	x = a[0] + a[1]
	flag = 0
	for i in range(2, len(a)):
		if a[i] >= x:
			print(1, 2, i + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	count = 1
	for i in range(2, n):
		if ar[i] >= ar[0] + ar[1]:
			print(1, 2, i + 1)
			count = 0
			break
	if count == 1:
		print(-1)


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	k = 0
	if a[0] + a[1] <= max(a):
		print(1, 2, n)
	else:
		print(-1)


def answ():
	x = int(input())
	s = list(map(int, input().split()))
	a = s[0]
	b = s[1]
	for n in range(x - 1, 1, -1):
		c = s[n]
		if a + b <= c or a + c <= b or b + c <= a:
			print(1, 2, n + 1)
			return
	b = s[-1]
	for n in range(x - 2, 0, -1):
		c = s[n]
		if a + b <= c or a + c <= b or b + c <= a:
			print(1, n + 1, x)
			return
	print(-1)
for i in range(int(input())):
	answ()


T = int(input())
for i in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	z = A[0] + A[1]
	flag = 0
	for j in range(2, N):
		if A[j] >= z:
			flag = 1
			break
	if flag == 1:
		print(1, 2, j + 1)
	else:
		print(-1)


t = int(input())
for asdasd in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	p = a[0]
	q = a[1]
	r = a[n - 1]
	if p + q <= r:
		print(1, 2, n)
	else:
		print('-1')


for testcases in range(int(input())):
	num = int(input())
	lis = list(map(int, input().split()))
	a = lis[0]
	b = lis[1]
	c = lis[-1]
	if c >= a + b:
		print(1, 2, num)
	else:
		print(-1)


from sys import stdin, stdout
from collections import defaultdict
input = lambda : stdin.readline().strip()
for _ in range(int(input())):
	n = int(input())
	lst = list(map(int, input().split()))
	sum1 = lst[0] + lst[1]
	if sum1 <= lst[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for case in range(t):
	n = int(input())
	a = [int(s) for s in input().split(' ')]
	if a[-1] >= a[0] + a[1]:
		print(1, 2, n)
	else:
		print(-1)


import os
import heapq
import sys
import math
import operator
from collections import defaultdict
from io import BytesIO, IOBase

def inpt():
	return [int(k) for k in input().split()]

def main():
	for _ in range(int(input())):
		n = int(input())
		ar = inpt()
		k = n - 1
		if ar[0] + ar[1] <= ar[k]:
			print(1, 2, n)
		else:
			print(-1)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


t = int(input())
for _ in range(t):
	n = int(input())
	ar = list(map(int, input().split()))
	if ar[0] + ar[1] <= ar[n - 1]:
		print('1 2', end=' ')
		print(n)
	else:
		print('-1')


t = int(input())
for x in range(t):
	n = int(input())
	arr = list(map(int, input().split(' ')))
	i = 1
	j = 2
	l = arr[0] + arr[1]
	y = 2
	while y < n:
		k = arr[y]
		if k >= l:
			k = y + 1
			break
		y += 1
	if y == n:
		print(-1)
	else:
		print(i, j, k)


import sys

def main():
	tn = int(sys.stdin.readline())
	r = None
	for ti in range(tn):
		n = int(sys.stdin.readline())
		A = [int(a) for a in sys.stdin.readline().split()]
		if A[0] + A[1] <= A[-1]:
			print(f'1 2 {n}')
		else:
			print('-1')
main()


def f(a):
	if a[0] + a[1] <= a[-1]:
		return [1, 2, len(a)]
	return -1
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	r = f(a)
	if r == -1:
		print(-1)
	else:
		for x in r:
			print(x, end=' ')
		print()


t = int(input())
a = []
b = []
for i in range(t):
	a.append([])
	b.append(int(input()))
	a[i] = [int(a[i]) for a[i] in input().split()]
	if a[i][0] + a[i][1] > a[i][b[i] - 1]:
		print('-1')
	else:
		print('1 2', end=' ')
		print(b[i])


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(' '.join(['1', '2', str(n)]))


for _ in range(int(input())):
	n = int(input())
	l = [int(x) for x in input().split()]
	if l[0] + l[1] <= l[-1]:
		print(1, 2, len(l))
	else:
		print(-1)


from collections import defaultdict as dd
from sys import stdin, stdout
for t in range(int(stdin.readline().strip())):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for p in range(t):
	n = int(input())
	x = [int(x) for x in input().split()]
	(i, j, k) = (0, 1, n - 1)
	(a, b, c) = (x[i], x[j], x[k])
	if a + b > c:
		print(-1)
	else:
		print(i + 1, j + 1, k + 1)


def solution(n, nums):
	first = nums[0]
	last = nums[n - 1]
	for i in range(1, n - 1):
		if first + nums[i] <= last:
			return f'1 {i + 1} {n}'
	return -1
tests = int(input().strip())
for _ in range(tests):
	n = int(input().strip())
	nums = list(map(int, input().strip().split()))
	print(solution(n, nums))


def ques1(n, a):
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)
t = int(input())
for i in range(t):
	n = int(input())
	a = [int(i) for i in input().split()]
	ans = ques1(n, a)
	ans


for ctr in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, ' ', 2, ' ', n)


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a[:2]) > a[-1]:
		print(-1)
	else:
		print(1, 2, len(a))


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	for i in range(n - 2):
		for j in range(i + 1, n - 1):
			for k in range(j + 1, n):
				if a[i] + a[j] > a[k] and a[i] + a[k] > a[j] and (a[j] + a[k] > a[i]):
					c = 1
					continue
				else:
					c = 0
					print('{} {} {}'.format(i + 1, j + 1, k + 1))
					break
				break
			break
		break
	if c == 1:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	sm = a[0] + a[1]
	ok = True
	for i in range(n - 1, 1, -1):
		if a[i] >= sm:
			print(1, 2, i + 1)
			ok = False
			break
	if ok:
		print('-1')


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	flag = 0
	for j in range(n - 2):
		if flag == 1:
			break
		for k in range(n - 1, j + 1, -1):
			if a[k] >= a[j] + a[j + 1]:
				print(j + 1, j + 2, k + 1)
				flag = 1
				break
			if a[k] < a[j] + a[j + 1]:
				break
	if flag == 0:
		print(-1)


t = int(input())
while t > 0:
	inp_int = int(input())
	inp = list(map(int, input().split()))
	if inp[0] + inp[1] <= inp[inp_int - 1]:
		print(1, 2, inp_int)
	elif inp[0] <= inp[inp_int - 1] - inp[inp_int - 2]:
		print(1, inp_int - 1, inp_int)
	else:
		print(-1)
	t -= 1


def solve():
	N = int(input())
	A = list(map(int, input().split()))
	if A[0] + A[1] <= A[-1]:
		return '{} {} {}'.format(1, 2, N)
	return '-1'
TC = int(input())
for _ in range(TC):
	print(solve())


from bisect import *
T = int(input())
for i in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	for i in range(N - 2):
		if A[i] + A[i + 1] > A[-1]:
			continue
		ind = bisect_left(A, A[i] + A[i + 1]) + 1
		print(i + 1, i + 2, ind)
		break
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	ans = -1
	if a[0] + a[1] <= a[n - 1]:
		ans = '1 2 ' + str(n)
	print(ans)


T = int(input())
for _ in range(T):
	n = int(input())
	a = list(map(int, input().split()))
	h = sorted(a)
	kel = max(a)
	if h[0] + h[1] <= kel:
		fir = h[0]
		sec = h[1]
		for i in range(n):
			if a[i] == fir:
				print(i + 1, end=' ')
				yu = i
				break
		for i in range(n):
			if a[i] == sec and i != yu:
				print(i + 1, end=' ')
				fyu = i
				break
		for i in range(n):
			if a[i] == kel and i != yu and (i != fyu):
				print(i + 1, end=' ')
				break
		print()
	else:
		print(-1)


def solve():
	nb = int(input())
	l = list(map(int, input().split()))
	c = True
	(imi1, mi1) = (l.index(min(l)) + 1, min(l))
	l.remove(min(l))
	(imi2, mi2) = (l.index(min(l)) + 2, min(l))
	l.remove(min(l))
	if max(l) >= mi1 + mi2:
		res = [imi1, imi2, l.index(max(l)) + 3]
		res.sort()
		print(res[0], res[1], res[2])
		c = False
	if c:
		print(-1)
n = int(input())
for _ in range(n):
	solve()


t = int(input())
while t:
	n = int(input())
	a = list(map(int, input().split()))
	if n > 2:
		flag = 0
		for i in range(len(a) - 2):
			if a[i] + a[i + 1] > a[n - 1]:
				continue
			else:
				flag = 1
				print(i + 1, end=' ')
				print(i + 2, end=' ')
				print(n)
				break
		if flag != 1:
			print('-1')
	t = t - 1


t = int(input())
for i in range(t):
	n = int(input())
	lst1 = list(map(int, input().split()))
	a = max(lst1)
	b = 0
	for i in range(1, n - 1):
		if lst1[0] + lst1[i] > a:
			continue
		else:
			b = 1
			break
	if b == 1:
		print(1, end=' ')
		print(i + 1, end=' ')
		print(n)
	else:
		print(-1)


def triangle(n, a):
	b = a[0] + a[1]
	for x in range(n):
		if a[x] >= b:
			print(1, 2, x + 1)
			return
	print(-1)
	return
t = int(input())
array = []
for i in range(t):
	a = []
	a.append(int(input()))
	a.append(list(map(int, input().split(' '))))
	array.append(a)
for x in array:
	triangle(*x)


t = int(input())
for _ in range(t):
	n = int(input())
	ls = list(map(int, input().split()))
	ls.sort()
	if ls[0] + ls[1] <= ls[-1]:
		print('1 2', n)
	else:
		print('-1')


for i in range(int(input())):
	numLen = int(input())
	nums = input()
	nums = list(map(int, nums.split()))
	numLen = len(nums)
	if numLen < 3:
		print(-1)
		continue
	answer = False
	for x in range(numLen):
		if x == numLen - 1:
			break
		a = nums[x]
		b = nums[x + 1]
		c = nums[numLen - x - 1]
		if not a + b > c and a + c > b and (b + c > a):
			print(' '.join(list(map(str, [x + 1, x + 2, numLen - x]))))
			answer = True
			break
	if not answer:
		print(-1)


import sys
input = sys.stdin.readline
T = int(input())
for t in range(T):
	N = int(input())
	A = [int(_) for _ in input().split()]
	if A[0] + A[1] <= A[-1]:
		print(1, 2, N)
	else:
		print(-1)


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	c = a[0] + a[1]
	d = ['1', '2']
	for i in range(2, len(a)):
		if a[i] >= c:
			d.append(str(i + 1))
			break
	if len(d) == 2:
		print(-1)
	else:
		print(' '.join(d))


for i in range(int(input())):
	g = input()
	a = [0] + list(map(int, input().split()))
	if a[1] + a[2] <= a[-1]:
		print(1, 2, g)
	else:
		print(-1)


t = int(input())
arrs = []
for i in range(t):
	_ = int(input())
	arr = [int(j) for j in input().split()]
	arrs.append(arr)
for arr in arrs:
	a1 = arr[0]
	a2 = arr[1]
	a3 = arr[-1]
	if a1 + a2 > a3:
		print(-1)
	else:
		print(1, 2, len(arr))


import sys
input = sys.stdin.readline
ins = lambda : input().rstrip()
ini = lambda : int(input().rstrip())
inm = lambda : map(int, input().split())
inl = lambda : list(map(int, input().split()))
ans = []
t = ini()
for _ in range(t):
	n = ini()
	a = inl()
	out = False
	i = 0
	j = 2
	while j < n:
		if a[i] + a[i + 1] <= a[j]:
			out = True
			break
		else:
			j += 1
	if out:
		ans.append(f'{i + 1} {i + 2} {j + 1}')
	else:
		ans.append('-1')
print('\n'.join(ans))


import heapq
for _ in range(int(input())):
	heap = []
	n = int(input())
	x = list(map(int, input().split()))
	for i in x:
		heapq.heappush(heap, i)
	a = heapq.heappop(heap)
	i = x.index(a)
	b = heapq.heappop(heap)
	if a == b:
		j = i + 1
	else:
		j = x.index(b)
	y = max(x)
	k = x.index(y)
	if a + b <= y:
		print(i + 1, j + 1, k + 1)
	else:
		print(-1)


def solve(n, a):
	(ind1, ind2, ind3) = (0, 0, 0)
	for i in range(n - 1):
		k = i + 1
		found = False
		for j in range(ind2 + 1, n):
			if a[i] + a[j] <= a[k] or a[j] + a[k] <= a[i] or a[k] + a[i] <= a[j]:
				found = True
				(ind1, ind2, ind3) = (i, k, j)
				break
		if found:
			print(ind1 + 1, ind2 + 1, ind3 + 1)
			break
		else:
			print(-1)
			break
t = int(input())
while t:
	n = int(input())
	a = [int(i) for i in input().split()]
	solve(n, a)
	t -= 1


t = int(input())
while t:
	n = int(input())
	l = [int(i) for i in input().split()]
	for i in range(n):
		for j in range(1, n):
			for k in range(2, n):
				if l[i] + l[j] > l[k]:
					pass
				else:
					print(i + 1, j + 1, k + 1)
					break
			else:
				print(-1)
				break
			break
		break
	t -= 1


from sys import stdin, stdout

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		arr = list(map(int, stdin.readline().split()))
		if arr[n - 1] >= arr[0] + arr[1]:
			print(1, 2, n)
		else:
			print(-1)
main()


import sys
t = int(input())
while t:
	t -= 1
	n = int(input())
	a = list(map(int, input().split()))
	k = a[0] + a[1]
	c = 0
	for i in range(2, n):
		if a[i] >= k:
			c = 1
			break
	if c == 1:
		print(1, 2, i + 1)
	else:
		print(-1)


def findTr(n, a):
	apb = a[0] + a[1]
	c = a[-1]
	if apb <= c:
		print(1, 2, n)
	else:
		print(-1)
	return
t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	findTr(n, a)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	l = 0
	l1 = 1
	l2 = 2
	t = 0
	while l2 < n:
		if a[l] + a[l1] > a[l2]:
			l2 += 1
		else:
			print(l + 1, l1 + 1, l2 + 1)
			t = 1
			break
	if t == 0:
		print(-1)


from sys import stdin, stdout
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().split()))
	x = a[0]
	y = a[1]
	z = a[-1]
	if x + y > z and y + z > x and (x + z > y):
		print(-1)
		continue
	print(1, 2, n)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	if l[0] + l[1] > l[-1] and l[0] + l[-1] > l[1] and (l[1] + l[-1] > l[0]):
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
while t:
	n = int(input())
	l = [int(x) for x in input().split()]
	for i in range(n - 1, 1, -1):
		if l[0] + l[1] <= l[i]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)
	t -= 1


cases = int(input())
for x in range(cases):
	input()
	l = input().split(' ')
	if len(l) >= 3 and int(l[0]) + int(l[1]) <= int(l[-1]):
		print('1 2', len(l))
	else:
		print(-1)


import sys
input = sys.stdin.buffer.readline
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))
inst = lambda : input().decode().rstrip('\n\r')
INF = float('inf')
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


import sys
from math import ceil, factorial, gcd
from collections import Counter, deque, defaultdict
from bisect import bisect_left, bisect_right
from heapq import heappop, heappush, heapify
MOD = 10 ** 9 + 7
INF = float('inf')
rl = lambda : list(map(int, sys.stdin.readline().split()))
rs = lambda : sys.stdin.readline().strip()
for _ in range(int(input())):
	n = int(input())
	A = rl()
	print(1, 2, n) if A[0] + A[1] <= A[-1] else print(-1)


import os
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from io import BytesIO, IOBase
from itertools import accumulate, combinations, combinations_with_replacement, groupby, permutations, product
from math import acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians, sin, sqrt, tan
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits

def inp():
	return int(input())

def inlist():
	return list(map(int, input().split()))

def instr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())

def main():
	t = inp()
	for _ in range(t):
		n = inp()
		d = inlist()
		a = d[0]
		b = d[1]
		c = d[-1]
		if a + b > c and a + c > b and (b + c > a):
			print(-1)
		else:
			print(1, 2, n)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
main()


import sys
input = lambda : sys.stdin.readline().strip()
char = [chr(i) for i in range(97, 123)]
CHAR = [chr(i) for i in range(65, 91)]
mp = lambda : list(map(int, input().split()))
INT = lambda : int(input())
rn = lambda : range(INT())
from math import ceil, sqrt, factorial, gcd
for _ in rn():
	n = INT()
	l = sorted(mp())
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


import math
import sys
from collections import Counter
from math import factorial as fact
from collections import defaultdict

def inpint():
	return int(input())

def inpstr():
	return str(input())

def inparr():
	return list(map(int, input().strip().split()))

def inptup():
	return map(int, input().strip().split())
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
T = int(sys.stdin.readline())
for _ in range(T):
	N = int(sys.stdin.readline())
	list_num = list(map(int, sys.stdin.readline().split()))
	if list_num[-1] >= list_num[0] + list_num[1]:
		print(1, 2, N)
	else:
		print(-1)


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())
t = inp()
for testcase in range(t):
	c = True
	n = inp()
	s = inlt()
	i = 0
	j = 1
	it = s[0] + s[1]
	for k in range(2, n):
		if s[k] >= it:
			print(1, 2, k + 1)
			c = False
			break
	if not c:
		continue
	print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	lst = input().split()
	if int(lst[0]) + int(lst[1]) <= int(lst[-1]):
		print('1 2 ' + str(n))
	else:
		print(-1)


def fun():
	n = int(input())
	a = list(map(int, input().split()))
	if a[n - 1] < a[0] + a[1]:
		print('-1')
	else:
		print('1 2 ' + str(n))
for i in range(int(input())):
	fun()


for _ in range(int(input())):
	(i, a) = (int(input()), list(map(int, input().split())))
	[print('1 2 {}'.format(str(i)) if a[0] + a[1] <= a[i - 1] else '-1')]


import os
import sys
from io import BytesIO, IOBase
from collections import Counter, defaultdict
from collections import deque
from functools import cmp_to_key
import math

def sin():
	return input()

def ain():
	return list(map(int, sin().split()))

def sain():
	return input().split()

def iin():
	return int(sin())
MAX = float('inf')
MIN = float('-inf')
MOD = 1000000007

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	s = set()
	for p in range(2, n + 1):
		if prime[p]:
			s.add(p)
	return s

def readTree(n, m):
	adj = [deque([]) for _ in range(n + 1)]
	for _ in range(m):
		(u, v) = ain()
		adj[u].append(v)
		adj[v].append(u)
	return adj

def main():
	for _ in range(iin()):
		n = iin()
		l = ain()
		ans = -1
		flag = 0
		if l[0] + l[1] <= l[-1]:
			print(1, 2, n)
			flag = 1
		if flag == 0:
			print(-1)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
if os.getcwd() == 'D:\\code':
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
	input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import io, os
inp = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
inin = lambda typ=int: typ(inp())
inar = lambda typ=int: list(map(typ, inp().split()))
inst = lambda : inp().decode().strip()
_T_ = inin()
for _t_ in range(_T_):
	n = inin()
	a = inar()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


import sys
import math
from functools import reduce
import bisect

def getN():
	return int(input())

def getNM():
	return map(int, input().split())

def getList():
	return list(map(int, input().split()))

def input():
	return sys.stdin.readline().rstrip()

def index(a, x):
	i = bisect.bisect_left(a, x)
	if i != len(a) and a[i] == x:
		return i
	return False
for _ in range(int(input())):
	n = getN()
	arr = getList()
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


from collections import defaultdict as dd
import math
import sys
import string
input = sys.stdin.readline

def nn():
	return int(input())

def li():
	return list(input())

def mi():
	return map(int, input().split())

def lm():
	return list(map(int, input().split()))

def solve():
	n = nn()
	lens = lm()
	if lens[0] + lens[1] <= lens[n - 1]:
		print(1, 2, n)
		return
	print(-1)
	return
q = nn()
for _ in range(q):
	solve()


for i in range(0, int(input())):
	n = int(input())
	list1 = list(map(int, input().strip().split()))[:n]
	if list1[0] + list1[1] <= list1[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


def answer(n, A):
	if A[0] + A[1] > A[-1]:
		return [-1]
	else:
		return [1, 2, n]
t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	print(*answer(n, arr))


def main():
	for _ in range(int(input())):
		n = int(input())
		a = sorted(map(int, input().split()))
		if a[0] + a[1] <= a[-1]:
			print(1, 2, n)
		else:
			print(-1)
main()


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(_) for _ in input().split()]
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import sys

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math
from collections import defaultdict
for _ in range(ri()):
	n = ri()
	l = ria()
	x = l[0] + l[1]
	for i in range(2, n):
		if l[i] >= x:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


res = ''
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[n - 1] >= a[0] + a[1]:
		res += f'1 2 {n}\n'
	else:
		res += '-1\n'
print(res)


t = int(input())
for case in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	minNum = 1000000000
	minInd = -1
	maxNum = 0
	maxInd = -1
	for i in range(n):
		num = a[i]
		if num < minNum:
			minInd = i
			minNum = num
		if num > maxNum:
			maxInd = i
			maxNum = num
	secondMin = 1000000000
	secondInd = -1
	for i in range(n):
		num = a[i]
		if num < secondMin:
			if i != minInd and i != maxInd:
				secondMin = num
				secondInd = i
	if minNum + secondMin <= maxNum:
		b = [minInd, secondInd, maxInd]
		b.remove(min(minInd, secondInd, maxInd))
		b.remove(max(minInd, secondInd, maxInd))
		middle = b[0]
		print(str(min(minInd, secondInd, maxInd) + 1) + ' ' + str(middle + 1) + ' ' + str(max(minInd, secondInd, maxInd) + 1))
	else:
		print(-1)


def func():
	n = int(input())
	a = list(map(int, input().split()))
	first = a[0]
	second = a[1]
	last = a[n - 1]
	if first + second <= last:
		return '1 2 ' + str(n)
	else:
		return '-1'
t = int(input())
for _ in range(t):
	print(func())


for _ in range(int(input())):
	n = int(input())
	s = [*map(int, input().split())]
	if s[0] + s[1] <= s[-1]:
		print(1, 2, n)
	else:
		print(-1)


from sys import stdin, stdout
t = int(stdin.readline().strip())
for _ in range(t):
	n = int(stdin.readline().strip())
	narr = list(map(int, stdin.readline().strip().split(' ')))
	if n == 3:
		arr = narr
		if arr[0] + arr[1] <= arr[2]:
			stdout.write(str(1) + ' ' + str(2) + ' ' + str(3) + '\n')
		else:
			stdout.write('-1\n')
	else:
		arr = [narr[0], narr[1], narr[-1]]
		if arr[0] + arr[1] <= arr[2]:
			stdout.write(str(1) + ' ' + str(2) + ' ' + str(n) + '\n')
		else:
			stdout.write('-1\n')


from bisect import bisect_left
for _ in range(int(input())):
	n = int(input())
	a = [*map(int, input().split())]
	a.sort()
	ans = [-1]
	for i in range(1, n):
		j = bisect_left(a, a[i] + a[i - 1])
		if j < n:
			ans = (i, i + 1, j + 1)
	print(*ans)


import sys
import string
import math
from collections import defaultdict
from functools import lru_cache
from collections import Counter
from fractions import Fraction

def mi(s):
	return map(int, s.strip().split())

def lmi(s):
	return list(mi(s))

def tmi(s):
	return tuple(mi(s))

def mf(f, s):
	return map(f, s)

def lmf(f, s):
	return list(mf(f, s))

def js(lst):
	return ' '.join((str(d) for d in lst))

def jsns(lst):
	return ''.join((str(d) for d in lst))

def line():
	return sys.stdin.readline().strip()

def linesp():
	return line().split()

def iline():
	return int(line())

def mat(n):
	matr = []
	for _ in range(n):
		matr.append(linesp())
	return matr

def matns(n):
	mat = []
	for _ in range(n):
		mat.append([c for c in line()])
	return mat

def mati(n):
	mat = []
	for _ in range(n):
		mat.append(lmi(line()))
	return mat

def pmat(mat):
	for row in mat:
		print(js(row))

def solve(arr):
	arr = list(enumerate(arr))
	arr.sort(key=lambda x: x[1])
	(i1, val1) = arr[-1]
	(i2, val2) = arr[0]
	(i3, val3) = arr[1]
	if val2 + val3 <= val1:
		x = min(i1, i2, i3)
		rest = [jj for jj in [i1, i2, i3] if jj != x]
		print(x + 1, min(rest) + 1, max(rest) + 1)
	else:
		print(-1)

def main():
	t = iline()
	for _ in range(t):
		line()
		arr = lmi(line())
		solve(arr)
main()


t = int(input())
for _ in range(t):
	n = int(input())
	s = list(map(int, input().split()))
	i = 0
	j = 1
	k = -1
	z = j + 1
	while z < n:
		if s[i] + s[j] <= s[z]:
			k = z
			break
		else:
			z += 1
	if k == -1:
		print(k)
	else:
		print(str(i + 1) + ' ' + str(j + 1) + ' ' + str(k + 1))


test = int(input().strip())
for _ in range(test):
	n = int(input().strip())
	arr = list(map(int, input().strip().split(' ')))
	(i1, i2, i3) = (0, 1, n - 1)
	if arr[i1] + arr[i2] <= arr[i3]:
		print(i1 + 1, i2 + 1, i3 + 1)
	else:
		print(-1)


import sys
buf = sys.stdin.read()
nowbuf = 0
endbuf = len(buf)

def getint():
	global nowbuf
	valnow = 0
	while buf[nowbuf] < '0' or buf[nowbuf] > '9':
		nowbuf += 1
	while nowbuf < endbuf and buf[nowbuf] >= '0' and (buf[nowbuf] <= '9'):
		valnow = valnow * 10 + int(buf[nowbuf])
		nowbuf += 1
	return valnow

def solve(n):
	a = []
	for i in range(0, n):
		a.append(getint())
	if a[0] + a[1] <= a[n - 1]:
		print('1 2', n)
	else:
		print('-1')
	return
t = getint()
for i in range(0, t):
	solve(getint())


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	sum1 = a[0] + a[1]
	found = 0
	for i in range(2, n):
		if sum1 <= a[i]:
			found = 1
			break
	if found != 1:
		print('-1')
	else:
		print(1, 2, i + 1)


from sys import stdin

def input():
	return stdin.readline().rstrip()
for _ in range(int(input())):
	L = int(input())
	s = list(map(int, input().split()))
	if s[0] + s[1] > s[-1]:
		print(-1)
	else:
		print(1, 2, L)


for i in range(int(input())):
	a = int(input())
	b = list(input().split())
	if int(b[0]) + int(b[1]) <= int(b[-1]):
		print('1', '2', a)
	else:
		print('-1')


from sys import stdin, stdout
from math import sqrt, gcd, ceil, floor, log2, log10, factorial, cos, acos, tan, atan, atan2, sin, asin, radians, degrees, hypot
from bisect import insort, insort_left, insort_right, bisect_left, bisect_right, bisect
from array import array
from functools import reduce
from itertools import combinations, combinations_with_replacement, permutations
from fractions import Fraction
from random import choice, getrandbits, randint, random, randrange, shuffle
from re import compile, findall, escape
from statistics import mean, median, mode
from heapq import heapify, heappop, heappush, heappushpop, heapreplace, merge, nlargest, nsmallest
for test in range(int(stdin.readline())):
	n = int(input())
	l = list(map(int, input().split()))
	ind1 = 0
	ind2 = 1
	ind3 = n - 1
	if l[ind1] + l[ind2] <= l[ind3]:
		print(ind1 + 1, ind2 + 1, ind3 + 1)
	else:
		print(-1)


T = int(input())
for _ in range(0, T):
	n = int(input())
	s = [int(x) for x in input().split()]
	if s[0] + s[1] <= s[-1]:
		print(1, 2, n)
	else:
		print(-1)


import datetime

def check(ar):
	for i in range(len(ar) - 2):
		s = ar[i] + ar[i + 1]
		j = len(ar) - 1
		if s <= ar[j]:
			li = (i + 1, i + 2, j + 1)
			return list(li)
		else:
			return [-1]
n = int(input())
res = []
for _ in range(n):
	q = int(input())
	arr = list(map(int, input().split()))
	res.append(arr)
for items in res:
	result = check(items)
	print(*result)
exit()


for _ in range(int(input())):
	n = int(input())
	v = list(map(int, input().split()))
	flag = 0
	if len(v) < 3:
		print(-1)
	else:
		a = v[0]
		b = v[1]
		summ = a + b
		flag = 0
		for i in range(2, len(v)):
			if v[i] >= summ:
				print(1, 2, i + 1, end=' ')
				print()
				flag = 1
				break
		if flag == 0:
			print(-1)


from __future__ import division, print_function
from sys import stdin, stdout
import bisect
import math
import heapq
i_m = 9223372036854775807

def inin():
	return int(input())

def stin():
	return input()

def spin():
	return map(int, stin().split())

def lin():
	return list(map(int, stin().split()))

def matrix(n):
	return [list(map(int, input().split())) for i in range(n)]

def calculate_sum(a, N):
	m = N / a
	sum = m * (m + 1) / 2
	ans = a * sum
	return ans

def series(N):
	return N * (N + 1) // 2

def count2Dmatrix(i, list):
	return sum((c.count(i) for c in list))

def modinv(n, p):
	return pow(n, p - 2, p)

def GCD(x, y):
	x = abs(x)
	y = abs(y)
	if min(x, y) == 0:
		return max(x, y)
	while y:
		(x, y) = (y, x % y)
	return x

def LCM(x, y):
	return x * y // GCD(x, y)

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def isprime(n):
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True
prime = []

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j
for _ in range(inin()):
	n = inin()
	a = lin()
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


tests = int(input())
for t in range(tests):
	length = int(input())
	raw = input()
	A = list(map(int, raw.split()))
	if A[length - 1] >= A[0] + A[1]:
		print('1 2', length)
	else:
		print('-1')


t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	flag = 0
	if len(l) <= 2:
		print(-1)
	else:
		for i in range(n - 1):
			if l[i] + l[i + 1] <= l[-1]:
				flag = 1
				ans = i + 1
				ans1 = i + 2
				ans3 = n
				break
		if flag == 0:
			print(-1)
		else:
			print(ans, ans1, ans3)


t = int(input())
for i in range(t):
	n = int(input())
	arr = [int(x) for x in input().split()]
	x = arr[0] + arr[1]
	flag = False
	for i in range(2, n):
		if arr[i] >= x:
			flag = True
			print(1, 2, i + 1)
			break
	if flag == False:
		print(-1)


def sieve():
	n = 10 ** 5
	s = [[] for i in range(n + 1)]
	for i in range(2, n + 1, 2):
		s[i] = [2]
	for i in range(3, n + 1, 2):
		if s[i]:
			continue
		else:
			for j in range(i, n + 1, i):
				s[j].append(i)
	return s

def prime():
	n = 10 ** 5
	s = [1 for i in range(n + 1)]
	for i in range(2, n + 1):
		if s[i] == 1:
			for j in range(i * i, i < n + 1, i):
				s[j] = 0
	primes = []
	for i in range(2, n + 1):
		if s[i] == 1:
			primes.append(i)
	return primes
for cases in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a = l[0]
	b = l[1]
	c = l[-1]
	if c < a + b:
		print(-1)
	else:
		print(1, 2, len(l))


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	i = 1
	if not (l[i - 1] + l[i] > l[-1] and l[i] + l[-1] > l[i] and (l[-1] + l[i - 1] > l[i])):
		print(1, 2, n)
	else:
		print(-1)


def findDegenerateTriangle(a):
	if a[-1] >= a[0] + a[1]:
		print('1 2 ' + str(len(a)))
	else:
		print('-1')

def convertToInt(a):
	for i in range(0, len(a)):
		a[i] = int(a[i])
	return a
t = int(input())
for i in range(t):
	n = int(input())
	a = input().split()
	a = convertToInt(a)
	findDegenerateTriangle(a)


import math
from itertools import combinations
from collections import Counter
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	f = 0
	x = [1, 2]
	for i in range(2, len(a)):
		if a[x[0] - 1] + a[x[1] - 1] <= a[i]:
			x.append(i + 1)
			f = 1
			break
	if f:
		for i in sorted(x):
			print(i, end=' ')
		print()
	else:
		print(-1)


import os
import sys
from io import BytesIO, IOBase
import math
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n, sep=' ')
	else:
		print('-1')


Test = int(input())
for i in range(Test):
	length = int(input())
	array = list(map(int, input().split()))
	if array[-1] >= array[0] + array[1]:
		print(1, 2, length)
	else:
		print(-1)


import sys
tc = int(sys.stdin.readline())
for _ in range(tc):
	n = int(sys.stdin.readline())
	arr = list(map(int, sys.stdin.readline().split()))
	find = False
	if arr[-1] >= arr[0] + arr[1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
res = []
for _ in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	if A[0] + A[1] <= A[-1]:
		res.append('{} {} {}'.format(1, 2, n))
	else:
		res.append('-1')
print('\n'.join(res))


T = int(input())
for i in range(T):
	N = int(input())
	lst = list(map(int, input().split()))
	lst.sort()
	if N < 3:
		print(-1)
	else:
		x = lst[0]
		y = lst[1]
		z = lst[-1]
		if x + y > z:
			print(-1)
		else:
			print(1, 2, N, sep=' ')


t = int(input())
for z in range(t):
	n = int(input())
	li = list(map(int, input().split()))
	first = li[0] + li[1]
	last = max(li)
	if last >= first:
		print(1, 2, n)
	elif last < first:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(ele) for ele in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n, end=' ')
		print('')
	else:
		print(-1)


def main(args):
	for i in range(int(input())):
		c = int(input())
		n = list(map(int, input().split(' ')))
		count = 0
		v = []
		if n[0] + n[1] > n[-1]:
			print(-1)
		else:
			print(1, 2, c)
import sys
sys.exit(main(sys.argv))


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	for i in range(n):
		for j in range(i + 1, n):
			if a[i] + a[j] <= a[-1]:
				print(i + 1, j + 1, n)
				break
			else:
				print('-1')
				break
		break


[(lambda N, n: print('1 2 %d' % N if n[0] + n[1] <= n[N - 1] else -1))(int(input()), list(map(int, input().split()))) for t in range(int(input()))]


for _ in range(int(input())):
	n = int(input())
	list1 = [int(x) for x in input().split()]
	val1 = list1[0] + list1[1]
	if val1 <= list1[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


def checker(n, lst):
	if lst[0] + lst[1] <= lst[-1]:
		return (1, 2, n)
	return (-1,)
for _ in range(int(input())):
	m = int(input())
	a = [int(i) for i in input().split()]
	print(*checker(m, a))


import sys

def input():
	return sys.stdin.readline().strip()

def iinput():
	return int(input())

def rinput():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))
mod = int(1000000000.0) + 7

def checkValidity(a, b, c):
	if a + b <= c or a + c <= b or b + c <= a:
		return True
	else:
		return False
for _ in range(iinput()):
	n = iinput()
	a = get_list()
	if checkValidity(a[0], a[1], a[-1]):
		print(1, 2, n)
	else:
		print(-1)


t = int(input(''))
for i in range(t):
	la = int(input(''))
	a = [int(x) for x in input('').split()]
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		for i in range(2, la):
			if a[0] + a[1] <= a[i]:
				print(1, 2, i + 1)
				break


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(i) for i in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(0 + 1, 1 + 1, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	(*a,) = map(int, input().split())
	if a[0] + a[1] <= a[-1]:
		print('{} {} {}'.format(1, 2, n))
	else:
		print(-1)


from itertools import combinations

def f(lst):
	if lst[0] + lst[1] <= lst[-1]:
		return ' '.join(map(str, (1, 2, len(lst))))
	return -1
for _ in range(int(input())):
	input()
	print(f(list(map(int, input().split()))))


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class union_find:

	def __init__(self, n):
		self.n = n
		self.rank = [0] * n
		self.parent = [int(j) for j in range(n)]

	def union(self, i, j):
		i = self.find(i)
		j = self.find(j)
		if self.rank[i] == self.rank[j]:
			self.parent[i] = j
			self.rank[j] += 1
		elif self.rank[i] > self.rank[j]:
			self.parent[j] = i
		else:
			self.parent[i] = j

	def find(self, i):
		temp = i
		if self.parent[temp] != temp:
			self.parent[temp] = self.find(self.parent[temp])
		return self.parent[temp]
from math import log2, ceil
from collections import deque, Counter as CC

def main():
	for t in range(int(input())):
		n = int(input())
		l = [int(j) for j in input().split()]
		if l[0] + l[1] <= l[-1]:
			print(1, 2, n)
		else:
			print(-1)
main()


T = int(input())
for t in range(1, T + 1):
	N = int(input())
	A = [int(s) for s in input().split()]
	if A[0] + A[1] <= A[-1]:
		print(1, 2, N)
	else:
		print(-1)


from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque, defaultdict as dd
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from itertools import permutations
from datetime import datetime
from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def bo(i):
	return ord(i) - ord('a')

def solve():
	for _ in range(ii()):
		n = ii()
		a = li()
		x = []
		for i in range(n):
			x.append([a[i], i + 1])
		x.sort()
		if x[0][0] + x[1][0] > x[-1][0]:
			print('-1')
		else:
			b = [x[0][1], x[1][1], x[-1][1]]
			b.sort()
			print(*b)
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
else:
	input = sys.stdin.readline
solve()


import sys

class ABadTriangle:

	def solve(self, tc=0):
		for _ in range(int(input())):
			n = int(input())
			a = [int(_) for _ in input().split()]
			(u, v, w) = (a[0], a[1], a[-1])
			if u + v <= w:
				print(1, 2, n)
			else:
				print(-1)
solver = ABadTriangle()
input = sys.stdin.readline
solver.solve()


t = int(input())
for i in range(t):
	n = int(input())
	lst = list(map(int, input().split()))
	m = max(lst)
	index = lst.index(m)
	flag = 0
	lst.pop(index)
	for i in range(len(lst) - 1):
		if lst[i] + lst[i + 1] <= m:
			print(i + 1, i + 2, index + 1)
			flag = 1
			break
	if flag == 0:
		print('-1')


from sys import stdin
inp = lambda : stdin.readline().strip()
t = int(inp())
for _ in range(t):
	n = int(inp())
	a = [int(x) for x in inp().split()]
	flag = False
	for i in range(2, n):
		if a[i] >= a[0] + a[1]:
			print(1, 2, i + 1)
			flag = True
			break
	if not flag:
		print(-1)


for i in [0] * int(input()):
	n = int(input())
	l = list(map(int, input().split(' ')))
	if l[0] + l[1] <= l[-1]:
		print('1 2', n)
	else:
		print(-1)


from collections import deque
from math import *
import heapq
from random import *
import sys
from copy import deepcopy
t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	a = l[0]
	b = l[1]
	c = l[-1]
	if a == 0 and b == 0 and (c == 0):
		print(1, 2, n)
	elif a + b > c:
		print(-1)
	else:
		print(1, 2, n)


from collections import defaultdict as dd
import sys
input = sys.stdin.readline
t = int(input())
while t:
	n = int(input())
	l = list(map(int, input().split()))
	lol = 0
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
		lol = 1
	if lol == 0:
		print(-1)
	t -= 1


a = int(input())
i = 0
while i < a:
	b = int(input())
	c = input().split(' ')
	d = []
	s = 0
	while s < b:
		d.append(int(c[s]))
		s = s + 1
	s = 0
	k = d
	k.sort()
	o = 0
	l = 0
	r = 0
	while s < b:
		if d[s] == k[0]:
			s = s + 1
			o = s
			break
		s = s + 1
	s = 1
	while s < b:
		if d[s] == k[1]:
			s = s + 1
			l = s
			break
		s = s + 1
	s = 0
	while s < b:
		if d[s] == k[-1]:
			s = s + 1
			r = s
			break
		s = s + 1
	if k[0] + k[1] <= k[-1]:
		print(o, l, r)
	else:
		print(-1)
	i = i + 1


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	(x, y) = (a[0], a[1])
	f = False
	for i in range(2, n):
		if x + y <= a[i]:
			print(1, 2, i + 1)
			f = True
			break
	if not f:
		print(-1)


import os
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from io import BytesIO, IOBase
from itertools import accumulate, combinations, combinations_with_replacement, groupby, permutations, product
from math import acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians, sin, sqrt, tan
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits

def inp():
	return int(input())

def inlist():
	return list(map(int, input().split()))

def instr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())

def main():
	t = inp()
	for _ in range(t):
		n = inp()
		d = inlist()
		a = d[0]
		b = d[1]
		c = d[-1]
		if a + b > c and a + c > b and (b + c > a):
			print(-1)
		else:
			print(1, 2, n)
main()


for t in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l1 = l.copy()
	l.sort()
	if l[0] + l[1] <= l[-1]:
		a = 0
		if l[0] == l[1]:
			a += 1
		print(l1.index(l[0]) + 1, l1.index(l[1]) + 1 + a, l1.index(l[-1]) + 1)
	else:
		print(-1)


for s in [*open(0)][2::2]:
	(x, y, *a, z) = map(int, s.split())
	print(*([1, 2, len(a) + 3], [-1])[x + y > z])


def find(a):
	result = []
	i = a[0]
	j = a[1]
	if i + j <= a[-1]:
		result = [1, 2, len(a)]
		return result
	return -1
t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	answer = find(a)
	if answer != -1:
		print(*answer)
	else:
		print(answer)


T = int(input())
for _ in range(T):
	n = int(input())
	ls = list(map(int, input().split()))
	ls.sort()
	a = ls[0]
	b = ls[1]
	c = ls[-1]
	if a + b > c:
		print(-1)
	else:
		print(1, 2, n)


for _ in [0] * int(input()):
	n = int(input())
	arr = [int(a) for a in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for i in range(t):
	a = [-1]
	n = int(input())
	arr = list(map(int, input().split()))
	for j in range(2, n):
		if arr[0] + arr[1] <= arr[j]:
			a = [1, 2, j + 1]
	for item in a:
		print(item, end=' ')


def solve(a, n):
	for i in range(n - 2):
		j = i + 1
		k = n - 1
		if a[i] + a[j] <= a[k]:
			print(f'{i + 1} {j + 1} {k + 1}')
			return
	print(-1)
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	solve(a, n)


for _ in range(int(input())):
	n = int(input())
	arr = list((int(i) for i in input().split()))
	mn1 = arr[0]
	mn2 = arr[1]
	mx1 = arr[-1]
	if mn1 + mn2 > mx1:
		print(-1)
	else:
		print(1, 2, n)


mod = 10 ** 9 + 7

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)
t = 1
t = int(input())
for _ in range(t):
	solve()


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(i) for i in input().split()]
	v = a[0] + a[1]
	a = a[2:]
	f = 0
	for i in range(len(a)):
		if v <= a[i]:
			print('1 2', i + 3, end='\n')
			f = 1
			break
	if not f:
		print('-1', end='\n')


def solve(n, arr):
	val = arr[0] + arr[1]
	for i in range(2, n):
		if val <= arr[i]:
			print(1, 2, i + 1)
			return
	for j in range(n - 2):
		if arr[j] + arr[j + 1] <= arr[j + 2]:
			print(j + 1, j + 2, j + 3)
			return
		else:
			continue
	print(-1)
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split(' ')))
	solve(n, arr)


for i in range(int(input())):
	n = int(input())
	k = 0
	mas = [int(i) for i in input().split()]
	for i in range(2, n):
		if mas[0] + mas[1] <= mas[i]:
			print(1, 2, i + 1)
			k += 1
			break
	if k == 0:
		print(-1)


cases = int(input())
for t in range(cases):
	n = int(input())
	a = list(map(int, input().split()))
	p = a[0] + a[1]
	pos = -1
	for i in range(2, n):
		if a[i] >= p:
			pos = i
			break
	if pos == -1:
		print(-1)
	else:
		print(1, 2, pos + 1)


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	found = False
	for j in range(2, n):
		if a[0] + a[1] <= a[j]:
			print(1, 2, j + 1)
			found = True
			break
	if not found:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	s = arr[0] + arr[1]
	f = 0
	th = 0
	for i in range(2, n):
		if s > arr[i]:
			continue
		else:
			f = 1
			th = i
	if f == 1:
		print('1 2', end=' ')
		print(th + 1)
	else:
		print(-1)


t = int(input())
for test in range(0, t):
	n = int(input())
	sides = list(map(int, input().split(' ')))
	if sides[0] + sides[1] <= sides[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
input = sys.stdin.readline
t = int(input())
for t1 in range(t):
	n = int(input())
	l = list(map(int, input().split(' ')))
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for q in range(t):
	n = int(input())
	ch = input()
	L = [int(i) for i in ch.split()]
	if L[0] + L[1] <= L[-1]:
		print(1, 2, n)
	else:
		print(-1)


T = int(input())
for t in range(T):
	n = int(input())
	xs = [int(x) for x in input().split()]
	if xs[0] + xs[1] <= xs[len(xs) - 1]:
		print(1, 2, len(xs))
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	lol = [int(n) for n in input().split()]
	z = lol.copy()
	z.sort()
	if z[0] + z[1] <= z[-1]:
		print(1, 2, n)
	else:
		print(-1)


def ans(n, A):
	if A[0] + A[1] > A[-1]:
		return [-1]
	else:
		return [1, 2, n]
t = int(input())
L = []
for i in range(t):
	n = int(input())
	A = [int(x) for x in input().split()]
	L.append(ans(n, A))
for l in L:
	for w in l:
		print(w, end=' ')
	print()


t = int(input())
for i in range(t):
	n = int(input())
	mas = list(map(int, input().split()))
	if len(mas) < 3:
		print(-1)
	elif mas[0] + mas[1] > mas[-1]:
		print(-1)
	else:
		print(1, 2, len(mas))


T = int(input())
l = []
for k in range(T):
	N = int(input())
	a = list(map(int, input().split()))
	f = 0
	for j in range(1, N - 1):
		if a[0] + a[j] <= a[N - 1]:
			l.append([1, j + 1, N])
			f = 1
			break
	if f == 0:
		l.append([-1])
for k in range(T):
	if l[k][0] == -1:
		print(-1)
	else:
		print(l[k][0], l[k][1], l[k][2])


def find_sides_indices(sorted_array):
	if sorted_array[0] + sorted_array[1] <= sorted_array[-1]:
		result = (0, 1, len(sorted_array) - 1)
	else:
		result = None
	return result

def main():
	t = int(input())
	for i in range(t):
		n = int(input())
		a = tuple(map(int, input().split()))
		indices = find_sides_indices(a)
		if indices is None:
			output = (-1,)
		else:
			output = sorted((i + 1 for i in indices))
		print(*output)
main()


import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
ns = lambda : readline().rstrip()
ni = lambda : int(readline().rstrip())
nm = lambda : map(int, readline().split())
nl = lambda : list(map(int, readline().split()))
T = ni()
for _ in range(T):
	n = ni()
	a = nl()
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


query = int(input())
for i in range(query):
	size = int(input())
	arr = list(map(int, input().split()))
	arr.sort()
	if arr[0] + arr[1] <= arr[size - 1]:
		print(1, 2, size)
	else:
		print(-1)


def solve(n, lst):
	if lst[0] + lst[1] > lst[-1]:
		return -1
	else:
		return '1 2 ' + str(n)
t = int(input())
for _ in range(t):
	n = int(input())
	lst = list(map(int, input().split(' ')))
	print(solve(n, lst))


t = int(input())
while t:
	t -= 1
	n = int(input())
	lis = [*map(int, input().split())]
	if lis[0] + lis[1] <= lis[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


for g in [*open(0)][2::2]:
	a = list(map(int, g.split()))
	n = len(a) - 1
	print(1, 2, n + 1) if a[0] + a[1] <= a[n] else print(-1)


import sys
import bisect
t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	(i1, j1, k1) = (0, 0, 0)
	if l[0] + l[1] <= l[n - 1]:
		(i1, j1, k1) = (1, 2, n)
	if i1 * j1 * k1 == 0:
		print(-1)
	else:
		print(i1, j1, k1)


def badt(n, a):
	if a[0] + a[n // 2] <= a[n - 1]:
		return [1, n // 2 + 1, n]
	else:
		for i in range(1, n // 2):
			sum = a[0] + a[i]
			if sum <= a[n - 1]:
				return [1, i + 1, n]
		return [-1]
n = int(input())
res = []
for i in range(n):
	p = int(input())
	a = list(map(int, input().split()))
	res.append(badt(p, a))
for j in res:
	tmp = len(j)
	tmp3 = str(j).strip('[]').replace(',', '')
	print(tmp3)


for _ in range(int(input())):
	n = int(input())
	d = {}
	l = [int(i) for i in input().split()]
	mn = 10000000000000
	idx = 0
	for i in range(n):
		if l[i] < mn:
			mn = l[i]
			idx = i
	d[idx] = l[idx]
	mn = 10000000000000
	idx = -1
	for i in range(n):
		if i not in d:
			if l[i] < mn:
				mn = l[i]
				idx = i
	d[idx] = l[idx]
	c = max(l)
	d[l.index(c)] = c
	r = sorted(d.keys())
	p = sorted(d.values())
	if p[0] + p[1] > p[-1]:
		print(-1)
	else:
		for i in r:
			print(i + 1, end=' ')
		print()


test_cases = int(input())
for _ in range(test_cases):
	n = int(input())
	a = [int(i) for i in input().split(' ')]
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


from sys import *
input = stdin.readline
output = stdout.write
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	ind = -1
	sn = a[0] + a[1]
	for i in range(2, n):
		if a[i] >= sn:
			ind = i
			break
	if ind == -1:
		output(str(-1) + '\n')
	else:
		output(str(1) + ' ' + str(2) + ' ' + str(ind + 1) + '\n')


import math
m = 1000000007

def fact(n):
	ans = 1
	for i in range(1, n + 1):
		ans = ans % m * (i % m) % m
	return ans

def power_2(n):
	ans = 1
	for i in range(n):
		ans = ans % m * 2 % m
	return ans
for z in range(int(input())):
	n = int(input())
	flag = True
	a = [int(i) for i in input().split()]
	for i in range(n - 2):
		if a[i] + a[i + 1] <= a[n - 1]:
			flag = False
			print(i + 1, i + 2, n)
			break
	if flag:
		print('-1')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	s = arr[0] + arr[1]
	flag = -1
	for i in range(2, n):
		if arr[i] >= s:
			flag = i + 1
			break
	if flag == -1:
		print(-1)
	else:
		print(1, 2, flag)


def ans(a, n):
	i = 1
	j = 2
	k = n
	if a[i - 1] + a[j - 1] > a[k - 1]:
		print(-1)
	else:
		print(str(i) + ' ' + str(j) + ' ' + str(k))
m = int(input())
for i in range(m):
	n = int(input())
	arr = input().split()
	a = []
	for i in arr:
		a.append(int(i))
	ans(a, n)


t = int(input())
ans = []

def solve(n, arr):
	Max = arr[-1]
	for l in range(n - 2):
		if arr[l] + arr[l + 1] <= Max:
			answer = [l + 1, l + 2, n]
			return answer
	return [-1]
for i in range(t):
	n = int(input())
	arr = [int(x) for x in input().split()]
	ans.append(solve(n, arr))
for test in ans:
	for num in test:
		print(num, end=' ')
	print()


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	length = int(input())
	if length < 3:
		print(-1)
		continue
	sequence = [int(i) for i in input().split()]
	min_side = sequence[0]
	max_side = sequence[-1]
	if sequence[1] <= max_side - min_side:
		print(1, 2, length)
	else:
		print(-1)


import sys, math, cmath, time
start_time = time.time()

def solve():
	n = inp()
	a = inlt()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, len(a))
	else:
		print(-1)

def main():
	global tt
	if not ONLINE_JUDGE:
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	t = 1
	t = inp()
	for tt in range(t):
		solve()
	if not ONLINE_JUDGE:
		print('Time Elapsed :', time.time() - start_time, 'seconds')
		sys.stdout.close()

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	return input().strip()

def invr():
	return map(int, input().split())

def counter(a):
	q = [0] * max(a)
	for i in range(len(a)):
		q[a[i] - 1] = q[a[i] - 1] + 1
	return q

def counter_elements(a):
	q = dict()
	for i in range(len(a)):
		if a[i] not in q:
			q[a[i]] = 0
		q[a[i]] = q[a[i]] + 1
	return q

def string_counter(a):
	q = [0] * 26
	for i in range(len(a)):
		q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
	return q

def factors(n):
	q = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			q.append(i)
			q.append(n // i)
	return list(sorted(list(set(q))))

def prime_factors(n):
	q = []
	while n % 2 == 0:
		q.append(2)
		n = n // 2
	for i in range(3, int(n ** 0.5) + 1, 2):
		while n % i == 0:
			q.append(i)
			n = n // i
	if n > 2:
		q.append(n)
	return list(sorted(q))

def transpose(a):
	(n, m) = (len(a), len(a[0]))
	b = [[0] * n for i in range(m)]
	for i in range(m):
		for j in range(n):
			b[i][j] = a[j][i]
	return b

def factorial(n, m=1000000007):
	q = 1
	for i in range(n):
		q = q * (i + 1) % m
	return q
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
	input = sys.stdin.readline
main()


import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
mod = 10 ** 9 + 7
mod1 = 998244353
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
sys.setrecursionlimit(300000)

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] < key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def binary(x, length):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] >= k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater

class BinaryTrie:

	class Node:

		def __init__(self, bit: bool=False):
			self.bit = bit
			self.children = []
			self.count = 0
			self.counter = 1

	def __init__(self, size):
		self.root = BinaryTrie.Node()
		self.size = size

	def convert(self, key):
		bits = []
		if isinstance(key, int):
			key = bin(key)[2:]
		if isinstance(key, str):
			for i in range(self.size - len(key)):
				bits += [False]
			for i in key:
				if i == '0':
					bits += [False]
				else:
					bits += [True]
		else:
			return list(key)
		return bits

	def add(self, key):
		node = self.root
		bits = self.convert(key)
		for bit in bits:
			found_in_child = False
			for child in node.children:
				if child.bit == bit:
					child.counter += 1
					node = child
					found_in_child = True
					break
			if not found_in_child:
				new_node = BinaryTrie.Node(bit)
				node.children.append(new_node)
				node = new_node
		node.count += 1

	def remove(self, key):
		node = self.root
		bits = self.convert(key)
		nodelist = [node]
		for bit in bits:
			for child in node.children:
				if child.bit == bit:
					node = child
					node.counter -= 1
					nodelist.append(node)
					break
		node.count -= 1
		if not node.children and (not node.count):
			for i in range(len(nodelist) - 2, -1, -1):
				nodelist[i].children.remove(nodelist[i + 1])
				if nodelist[i].children or nodelist[i].count:
					break

	def query(self, prefix, root=None):
		if not root:
			root = self.root
		node = root
		if not root.children:
			return 0
		for bit in prefix:
			bit_not_found = True
			for child in node.children:
				if child.bit == bit:
					bit_not_found = False
					node = child
					break
			if bit_not_found:
				return 0
		return node

class TrieNode:

	def __init__(self):
		self.children = [None] * 26
		self.data = 0
		self.isEndOfWord = False

class Trie:

	def __init__(self):
		self.root = self.getNode()

	def getNode(self):
		return TrieNode()

	def _charToIndex(self, ch):
		return ord(ch) - ord('a')

	def insert(self, key, val):
		pCrawl = self.root
		length = len(key)
		for level in range(length):
			index = self._charToIndex(key[level])
			if not pCrawl.children[index]:
				pCrawl.children[index] = self.getNode()
			pCrawl = pCrawl.children[index]
			pCrawl.data += val
		pCrawl.isEndOfWord = True

	def search(self, key):
		pCrawl = self.root
		length = len(key)
		c = 0
		for level in range(length):
			index = self._charToIndex(key[level])
			if not pCrawl.children[index]:
				return False
			pCrawl = pCrawl.children[index]
		return pCrawl != None

	def present(self, key):
		ans = 0
		pCrawl = self.root
		length = len(key)
		c = 0
		for level in range(length):
			index = self._charToIndex(key[level])
			if not pCrawl.children[index]:
				return False
			pCrawl = pCrawl.children[index]
			ans += pCrawl.data
		if pCrawl != None:
			return ans
		return -1
for ik in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	f = 0
	for i in range(2, n):
		if l[i - 1] + l[i - 2] <= l[-1]:
			print(i - 1, i, n)
			f = 1
			break
	if f == 0:
		print(-1)


import sys
from collections import defaultdict
for _ in range(int(input())):
	n = int(input())
	lis = list(map(int, input().split()))
	if lis[0] + lis[1] <= lis[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())

def doit(t):
	s = int(input())
	a = input()
	na = list(map(int, a.split()))
	if na[0] + na[1] > na[s - 1]:
		print(-1)
	else:
		print('1 2', s)
while t:
	t -= 1
	doit(t)


for _ in range(int(input())):
	am = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, am)


import math
from collections import Counter
for test in range(int(input())):
	n = int(input())
	A = list(map(int, input('').split()))
	ans = [1, 2, n]
	if A[0] + A[1] <= A[-1]:
		print(*ans)
	else:
		print(-1)


num = int(input())
for n in range(num):
	num2 = int(input())
	lis = list(map(int, input().split()))
	lis2 = lis[:]
	a = lis.index(min(lis))
	numa = lis.pop(a)
	b = lis.index(min(lis))
	numb = lis.pop(b)
	ch = True
	for i in lis2:
		if numa + numb <= i:
			print(1, 2, lis2.index(i) + 1)
			ch = False
			break
	if ch:
		print(-1)


from sys import *
input = stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	c = 0
	a = l[0] + l[1]
	b = l[-1]
	if a <= b:
		print(1, 2, n)
	else:
		print(-1)


n = int(input())
for i in range(n):
	m = input()
	lst1 = list(map(int, input().split()))
	lst2 = sorted(lst1)
	if lst2[0] + lst2[1] <= lst2[-1]:
		x = lst1.index(lst2[0]) + 1
		y = lst1.index(lst2[1]) + 1
		z = lst1.index(lst2[-1]) + 1
		if x == y:
			print(f'{x} {y + 1} {z}')
		else:
			print(f'{x} {y} {z}')
	else:
		print(-1)


T = int(input())
res = list()
for _ in range(T):
	n = int(input())
	x = list(map(int, input().split()))
	if len(x) <= 2:
		res.append([-1])
		continue
	(a, b) = (x[0], x[1])
	ok = False
	for i in range(2, len(x)):
		if a + b <= x[i]:
			res.append([1, 2, i + 1])
			ok = False
			break
		else:
			ok = True
	if ok:
		res.append([-1])
for i in res:
	if len(i) == 3:
		print(i[0], i[1], i[2])
	else:
		print(i[0])


t = int(input())
while t != 0:
	n = int(input())
	txt = input()
	v = txt.split(' ')
	if int(v[0]) + int(v[1]) <= int(v[n - 1]):
		print(1, 2, n)
	else:
		print(-1)
	t -= 1


m = int(input())
for i in range(m):
	n = int(input())
	a = list(map(int, input().split(' ')))
	for j in range(2, len(a)):
		if a[j] >= a[0] + a[1]:
			print(1, 2, j + 1)
			break
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a = l[0]
	b = l[1]
	c = l[len(l) - 1]
	if (a + b > c and b + c > a and (c + a > b)) == False:
		print(1, 2, n)
	else:
		print(-1)


from sys import stdin
input = stdin.readline

def A():
	t = int(input())
	for _ in range(t):
		n = int(input())
		a = list(map(int, input().split()))
		a.sort()
		found = False
		if a[0] + a[1] <= a[n - 1]:
			print(1, 2, n)
		else:
			print(-1)

def B():
	t = int(input())
	for _ in range(t):
		print(0)

def C():
	t = int(input())
	for _ in range(t):
		print(0)

def D():
	t = int(input())
	for _ in range(t):
		print(0)
A()


def main():
	for _ in range(int(input())):
		input()
		vector = input().split()
		if int(vector[0]) + int(vector[1]) <= int(vector[-1]):
			print(1, 2, len(vector))
		else:
			print(-1)
main()


t = int(input())
for o in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	x = a[n - 1]
	y = a[0]
	flag = 0
	for i in range(1, n - 1):
		if a[i] + y <= x:
			flag = 1
			break
	if flag == 1:
		print(1, i + 1, n)
	else:
		print(-1)


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	a = [[int(x), 0] for x in input().split()]
	for i in range(n):
		a[i][1] = i + 1
	a.sort(key=lambda x: x[0])
	if a[-1][0] >= a[0][0] + a[1][0]:
		print(a[0][1], a[1][1], a[-1][1])
	else:
		print(-1)


for i in range(0, int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	f = 0
	for j in range(2, n):
		if a[0] + a[1] > a[j]:
			continue
		else:
			f = 1
			print(1, 2, j + 1)
			break
	if f == 0:
		print('-1')


t = int(input())
while t > 0:
	n = int(input())
	arr = input().split()
	arr = [int(i) for i in arr]
	if arr[0] + arr[1] > arr[n - 1] and arr[1] + arr[n - 1] > arr[0] and (arr[n - 1] + arr[0] > arr[1]):
		print(-1)
	else:
		print(1, 2, n)
	t -= 1


def A():
	n = int(input())
	arr = list(map(int, input().split()))
	x = arr[0] + arr[1]
	ans = []
	if arr[-1] >= x:
		ans.append(1)
		ans.append(2)
		ans.append(n)
		return ans
	return ans
t = int(input())
for i in range(t):
	ans = A()
	if not ans:
		print('-1')
	else:
		for i in range(3):
			print(ans[i], end=' ')
		print('')


case = int(input())
for caseNum in range(0, case):
	n = int(input())
	numberList = [int(x) for x in input().split()]
	if numberList[0] + numberList[1] > numberList[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


def triangle(A):
	n = len(A)
	z = A[-1]
	x = A[0]
	y = A[1]
	if x + y > z:
		print(-1)
	else:
		print(1, 2, n)
t = int(input())
for i in range(t):
	n = int(input())
	A = [int(z) for z in input().split()][:n]
	triangle(A)


import sys
import math
import heapq
import collections
fast_reader = sys.stdin.readline
fast_writer = sys.stdout.write

def input():
	return fast_reader().strip()

def print(*argv):
	fast_writer(' '.join((str(i) for i in argv)))
	fast_writer('\n')

def printspace(*argv):
	fast_writer(' '.join((str(i) for i in argv)))
	fast_writer(' ')

def inputnum():
	return int(input())

def inputnums():
	return map(int, input().split())

def inputlist():
	return list(map(int, input().split()))

def inputstring():
	return [x for x in input()]

def inputmatrixchar(rows):
	arr2d = [[j for j in input().strip()] for i in range(rows)]
	return arr2d

def inputmatrixint(rows):
	arr2d = []
	for _ in range(rows):
		arr2d.append([int(i) for i in input().split()])
	return arr2d
t = int(input())
for q in range(t):
	n = inputnum()
	a = inputlist()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


def triplet(arr: list):
	if len(arr) == 0:
		return [-1]
	if len(arr) == 3:
		if arr[-1] >= arr[0] + arr[1]:
			return [1, 2, 3]
		return [-1]
	for i in range(len(arr) - 1, 2, -1):
		if arr[i] > arr[0] + arr[1]:
			return [1, 2, i + 1]
	return [-1]
t = int(input())
while t > 0:
	x = int(input())
	arr = [int(i) for i in input().split()]
	ans = triplet(arr)
	for j in ans:
		print(j, end=' ')
	print()
	t -= 1


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().strip().split()))[:n]
	i = a[0]
	j1 = a[1]
	j2 = a[-2]
	k = a[-1]
	if i + j1 <= k:
		print(1, 2, n)
	elif i + j2 <= k:
		print(1, n - 1, n)
	else:
		print(-1)


def bad_triangle(n, a):
	if len(a) < 3:
		return -1
	if a[-1] < a[0] + a[1]:
		return -1
	else:
		return [1, 2, n]
test = int(input())
for i in range(test):
	n = int(input())
	a = list(map(int, input().split()))
	ans = bad_triangle(n, a)
	if ans == -1:
		print(-1)
	else:
		print(*ans)


n = int(input())
for _ in range(n):
	m = int(input())
	arr = list(map(int, input().split()))
	x = arr[0] + arr[1]
	flag = False
	for i in range(2, len(arr)):
		if x <= arr[i]:
			print(f'1 2 {i + 1}')
			flag = True
			break
	if not flag:
		print('-1')


def findTriangle(arr, n):
	if n < 3:
		return -1
	i = 0
	j = 1
	k = 2
	while k < n - 1:
		if arr[i] + arr[j] <= arr[k] or arr[j] + arr[k] <= arr[i] or arr[i] + arr[k] <= arr[j]:
			return str(i + 1) + ' ' + str(j + 1) + ' ' + str(k + 1)
		k += 1
	while j < n - 2:
		if arr[i] + arr[j] <= arr[k] or arr[j] + arr[k] <= arr[i] or arr[i] + arr[k] <= arr[j]:
			return str(i + 1) + ' ' + str(j + 1) + ' ' + str(k + 1)
		j += 1
	while i < n - 2:
		if arr[i] + arr[j] <= arr[k] or arr[j] + arr[k] <= arr[i] or arr[i] + arr[k] <= arr[j]:
			return str(i + 1) + ' ' + str(j + 1) + ' ' + str(k + 1)
		i += 1
	return -1
t = int(input())
main_arr = []
n_s = []
for a in range(0, t):
	n = int(input())
	n_s.append(n)
	arr = input().rstrip().split(' ')
	for b in range(0, n):
		arr[b] = int(arr[b])
	main_arr.append(arr)
for c in range(0, t):
	print(findTriangle(main_arr[c], n_s[c]))


T = int(input())
while T != 0:
	N = int(input())
	A = list(map(int, input().strip().split()))[:N]
	found = False
	if A[0] + A[1] <= A[N - 1]:
		found = True
	if found:
		ans = [1, 2, N]
		print(*ans)
	else:
		print(-1)
	T -= 1


import sys

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 19
MOD = 10 ** 9 + 7
for _ in range(INT()):
	N = INT()
	A = LIST()
	(a, b, c) = (A[0], A[1], A[-1])
	if a + b <= c:
		print(1, 2, N)
	else:
		print(-1)


t = int(input())
natija = []
for j in range(t):
	n = int(input())
	satr = input()
	ruyhat = satr.split(' ')
	for i in range(n):
		ruyhat[i] = int(ruyhat[i])
	if ruyhat[0] + ruyhat[1] <= ruyhat[n - 1]:
		natija.append(str(1) + ' ' + str(2) + ' ' + str(n))
	else:
		natija.append(-1)
for i in range(t):
	print(natija[i])


Q = int(input())
for q in range(Q):
	N = int(input())
	L = list(map(int, input().split()))
	L.sort()
	if L[-1] >= L[0] + L[1]:
		print(1, 2, N)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = [int(x) for x in input().split()]
	h = l[0] + l[1]
	count = 0
	for i in range(2, n):
		if l[i] >= h:
			count = 1
			print('1 2', i + 1)
			break
	if count == 0:
		print(-1)


for _ in range(int(input())):
	N = int(input())
	array = [int(x) for x in input().split()]
	if array[0] + array[1] <= array[-1]:
		print(1, 2, N)
	else:
		print(-1)


import copy

def get_output(array, length):
	max = array[-1]
	i = 0
	while i != length - 2:
		sum = array[i] + array[i + 1]
		if sum <= max:
			return (i + 1, i + 2, length)
		else:
			i += 1
	return -1
test_cases = int(input())
for i in range(test_cases):
	length = int(input())
	array = [int(i) for i in input().split()]
	res = get_output(array, length)
	if res != -1:
		for i in res:
			print(i, end=' ')
		print()
	else:
		print(res)


for test_i in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	(max_el, min_el1) = (max(arr), min(arr))
	(max_eli, min_el1i) = (arr.index(max_el), arr.index(min_el1))
	arr[min_el1i] = max_el + 1
	min_el2 = min(arr)
	min_el2i = arr.index(min_el2)
	ans = [max_eli + 1, min_el1i + 1, min_el2i + 1]
	ans.sort()
	print(' '.join(list(map(str, ans))) if min_el1 + min_el2 <= max_el else -1)


t = int(input())
for i in range(t):
	n = int(input())
	arr = input()
	arr = arr.strip()
	arr = arr.split(' ')
	arr = list(map(int, arr))
	a = arr[0]
	b = arr[1]
	c = arr[n - 1]
	if c >= a + b:
		print(1, 2, n)
	else:
		print(-1)


import sys
import heapq
import math
from collections import deque
from collections import defaultdict
from collections import Counter
modH = int(10 ** 9) + 7
I = lambda : list(map(int, input().split(' ')))

def PRINT(lst, sep=' '):
	print(sep.join(map(str, lst)))
for _ in range(int(input())):
	n = int(input())
	lst = I()
	if lst[-1] >= lst[0] + lst[1]:
		ans = [1, 2, n]
		PRINT(ans)
	else:
		print(-1)


case = int(input())
while case != 0:
	n = int(input())
	a = list(map(int, input().split()))
	chk = False
	i = 0
	for i in range(n - 2):
		if a[i] + a[i + 1] <= a[n - 1]:
			print('1', '2', n)
			chk = True
			break
	if chk == False:
		print('-1')
	case -= 1


def solve(n, arr):
	if arr[0] + arr[1] > arr[-1]:
		print('-1')
	else:
		print(f'1 2 {n}')
t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	solve(n, arr)


T = int(input())
for test in range(T):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[-1]:
		print('1 2 {}'.format(n))
	else:
		print(-1)


def tri():
	n = int(input())
	for i in range(n):
		a = int(input())
		b = input().strip().split()
		if int(b[0]) + int(b[1]) <= int(b[len(b) - 1]):
			print(1, 2, len(b))
		else:
			print(-1)
tri()


for _ in range(int(input())):
	t = 1
	n = int(input())
	a = list(map(int, input().split()))
	for k in range(2, n):
		if a[k] >= a[0] + a[1] and t:
			t = 0
			print(1, 2, k + 1)
			break
	if t:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	maxx = max(l)
	minn = min(l)
	minn_ind = l.index(minn)
	minn2 = maxx
	for i in range(n):
		if i == minn_ind:
			continue
		if l[i] == minn:
			minn2 = minn
			minn2_ind = i
			break
		if l[i] < minn2:
			minn2 = l[i]
			minn2_ind = i
	if minn + minn2 <= maxx:
		maxx_ind = l.index(maxx)
		temp = [minn_ind, minn2_ind, maxx_ind]
		temp.sort()
		for j in temp:
			print(j + 1, end=' ')
		print()
		continue
	print('-1')


import io
import os
from collections import Counter, defaultdict, deque

def solve(N, A):
	a = A[0]
	b = A[1]
	c = A[-1]
	if a + b > c and a + c > b and (b + c > a):
		return -1
	return str(1) + ' ' + str(2) + ' ' + str(N)
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
TC = int(input())
for tc in range(1, TC + 1):
	(N,) = [int(x) for x in input().split()]
	A = [int(x) for x in input().split()]
	ans = solve(N, A)
	print(ans)


for _ in range(int(input())):
	n = int(input())
	A = [int(a) for a in input().split()]
	(i, j, k) = (1, 2, n)
	flag = True
	if A[0] + A[1] > A[n - 1]:
		flag = False
	if flag:
		print(i, j, k)
	else:
		print(-1)


def nextInt():
	return int(input())

def intArr():
	arr = input().split(' ')
	return [int(x) for x in arr]
t = nextInt()
ans = []
for tt in range(t):
	length = nextInt()
	a = []
	s = intArr()
	cur = s.pop()
	if cur - s[0] <= 1:
		ans.append(-1)
	elif cur - (s[0] + s[1]) < 0:
		ans.append(-1)
	else:
		ans.append('1 2 {}'.format(len(s) + 1))
for x in ans:
	print(x)


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	s = a[0] + a[1]
	sa = a[n - 1]
	if s <= sa:
		print('{} {} {}'.format(1, 2, n))
	else:
		print('-1')


from sys import stdin, stdout
import bisect
n = int(stdin.readline())
for i in range(n):
	ans = 0
	a = int(stdin.readline())
	x = [int(i) for i in stdin.readline().split()]
	x.sort()
	if x[0] + x[1] > x[-1]:
		stdout.write('-1' + '\n')
		continue
	stdout.write(str(1) + ' ' + str(2) + ' ' + str(len(x)) + '\n')


t = int(input())
for k in range(t):
	l = 0
	n = int(input())
	a = [int(x) for x in input().split()]
	mina = a.index(min(a))
	maxa = a.index(max(a))
	for i in range(n):
		if i != mina and a[mina] + a[i] <= a[maxa]:
			print(mina + 1, i + 1, maxa + 1)
			l = 1
			break
	if l != 1:
		print(-1)


def solver(arr):
	k = len(arr) - 1
	if arr[0] + arr[1] <= arr[k]:
		return [1, 2, k + 1]
	else:
		return [-1]
for t in range(int(input())):
	_ = int(input())
	arr = list(map(int, input().split()))
	for i in solver(arr):
		print(i, end=' ')
	print()


t = int(input())
while t > 0:
	a = int(input())
	l = list(map(int, input().split()))
	l.sort()
	x = l[0]
	y = l[1]
	z = max(l)
	if x + y <= z:
		print(1, 2, a)
	else:
		print('-1')
	t -= 1


import sys
input = sys.stdin.readline

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def nCr(n, k):
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def upper_bound(a, x, lo=0, hi=None):
	if hi == None:
		hi = len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if a[mid] < x:
			lo = mid + 1
		else:
			hi = mid
	return lo

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i

def factoriazation(x):
	ret = {}
	while x != 1:
		ret[spf[x]] = ret.get(spf[x], 0) + 1
		x = x // spf[x]
	return ret

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
from itertools import permutations

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	minim = a.index(min(a))
	maxim = a.index(max(a))
	ans = [minim + 1, maxim + 1]
	val = 0
	for x in range(n):
		if x == minim or x == maxim:
			continue
		if a[minim] + a[x] <= a[maxim]:
			val = x + 1
			break
	ans.append(val)
	if val == 0:
		print(-1)
	else:
		print(*list(sorted(ans)))
for _ in range(int(input())):
	solve()


t = int(input())
for _ in range(t):
	flag = 0
	n = int(input())
	inp = list(map(int, input().split()))
	if inp[0] + inp[1] <= inp[-1]:
		print(1, end=' ')
		print(2, end=' ')
		print(len(inp))
		continue
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	x = a[0]
	s1 = 1
	y = a[1]
	s2 = 2
	z = a[-1]
	s3 = n
	if len(set(a)) != 1 and x + y <= z or y + z <= x or x + z <= y:
		print(s1, s2, s3)
	else:
		print(-1)


def solve(n, arr):
	if arr[0] + arr[1] > arr[n - 1]:
		return -1
	else:
		return '1 2 ' + str(n)
t = int(input())
for i in range(0, t):
	n = int(input())
	arr = list(map(int, input().rstrip().split(' ')))
	print(solve(n, arr))


import sys
import math
import collections
from sys import stdin, stdout, setrecursionlimit
import bisect as bs
setrecursionlimit(2 ** 20)
M = 10 ** 9 + 7
T = int(stdin.readline())
for _ in range(T):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().split()))
	b = []
	for i in range(n):
		b.append((a[i], i + 1))
	b.sort()
	if b[-1][0] >= b[0][0] + b[1][0]:
		fin = [b[-1][1], b[0][1], b[1][1]]
		fin.sort()
		for h in fin:
			print(h, end=' ')
		print('')
	else:
		print(-1)


n = int(input())
for i in range(n):
	num_arr = int(input())
	arr = input().split(' ')
	if len(arr) < 3:
		print('-1')
		continue
	if int(arr[0]) + int(arr[1]) <= int(arr[-1]):
		print('1 2 ' + str(len(arr)))
	else:
		print('-1')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	(mi, mi_idx, ma, ma_idx) = (10 ** 10, 0, 0, 0)
	for i in range(n):
		if a[i] < mi:
			(mi, mi_idx) = (a[i], i)
		if a[i] > ma:
			(ma, ma_idx) = (a[i], i)
	ans = [mi_idx + 1, ma_idx + 1]
	for i in range(n):
		if i == mi_idx or i == ma_idx:
			continue
		if not (mi - ma < a[i] < mi + ma and mi - a[i] < ma < mi + a[i] and (ma - a[i] < mi < ma + a[i])):
			ans.append(i + 1)
			break
	if len(ans) == 2:
		print(-1)
	else:
		print(*sorted(ans))


t = int(input())
myList = []
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		myList.append([-1])
	else:
		elem = [1, 2, n]
		myList.append(elem)
for thing in myList:
	print(*thing)


def printSolution(array):
	if len(array) >= 3:
		if array[0] + array[1] <= array[-1]:
			print(1, 2, len(array))
			return
	print(-1)

def submit():
	for case in range(int(input())):
		input()
		array = [int(e) for e in input().split()]
		printSolution(array)
submit()


from collections import defaultdict
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	mi = a[0]
	mx = a[n - 1]
	flag = 0
	for i in range(1, n - 1):
		if a[i] <= mx - mi:
			print(1, i + 1, n)
			flag = 1
			break
	if flag == 0:
		print(-1)


T = int(input())
while T:
	n = int(input())
	A = list(map(int, input().split()))
	a = A[0]
	b = -1
	c = A[n - 1]
	k = -1
	for i in range(1, n - 1):
		if a + A[i] <= c:
			b = A[i]
			k = i + 1
			break
	if b > 0:
		print(1, k, n)
	else:
		print(-1)
	T = T - 1


from sys import stdin
inp = lambda : stdin.readline().strip()
t = int(inp())
for _ in range(t):
	n = int(inp())
	a = [int(x) for x in inp().split()]
	for i in range(2, n):
		if a[i] >= a[0] + a[1]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	w = False
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[n - 1]:
		print(1, end=' ')
		print(2, end=' ')
		print(n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	k = a[0] + a[1]
	c = 0
	for i in range(2, n):
		if a[i] >= k:
			b = i
			c = 1
			break
	if c == 0:
		print(-1)
	else:
		print(1, 2, b + 1)


test_cases = int(input())
for tests in range(0, test_cases):
	n = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] <= l[n - 1]:
		print(f'1 2 {n}')
	else:
		print(-1)


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log2, ceil
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
from collections import Counter
from collections import deque
from heapq import heappush, heappop, heapify
mod = int(1000000000.0) + 7
ip = lambda : int(stdin.readline())
inp = lambda : map(int, stdin.readline().split())
ips = lambda : stdin.readline().rstrip()
t = ip()
for _ in range(t):
	n = ip()
	arr = list(inp())
	for i in range(n):
		arr[i] = [arr[i], i]
	arr.sort()
	if arr[0][0] + arr[1][0] <= arr[-1][0]:
		(a, b, c) = (arr[0][1], arr[1][1], arr[-1][1])
		(a, b, c) = (a + 1, b + 1, c + 1)
		print(a, b, c)
	else:
		print(-1)


for _ in range(int(input())):
	inp = input()
	y = list(map(int, input().split()))
	if y[0] + y[1] <= y[-1]:
		print(1, 2, len(y))
	else:
		print(-1)


import math
import collections
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect_left as bsl
from bisect import bisect_right as bsr
import heapq as hq
setrecursionlimit(2 ** 20)
t = 1
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().rstrip().split()))
	(s1, s2, s3) = (a[0], a[1], a[-1])
	if a[-1] < a[0] + a[1]:
		print(-1)
	else:
		print('1 2 ', end='')
		print(n)


def sol(inp, n):
	sm = []
	ind = []
	po = 0
	for i in range(n):
		sm.append(inp[i])
		ind.append(i + 1)
		po += 1
		if po == 2 and sum(sm) <= inp[-1]:
			print(*ind, end=' ')
			print(n)
			return
		if sum(sm) > inp[-1]:
			sm = []
			ind = []
			po = 0
		continue
	print(-1)
	return
for _ in range(int(input())):
	n = int(input())
	inp = list(map(int, input().split()))
	sol(inp, n)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(x) for x in input().split()]
	total = arr[0] + arr[1]
	j = 0
	for i in range(2, n):
		if arr[i] >= total:
			j = i + 1
			break
	if j == 0:
		print('-1')
	else:
		print('1 2', j)


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	arr = list(map(int, input().strip().split(' ')))
	a = arr[-1]
	b = arr[0]
	c = arr[1]
	if c + b > a:
		print(-1)
	else:
		print(1, 2, n)


import sys
input = lambda : sys.stdin.readline().rstrip()
for _ in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	c = l[n - 1]
	ok = False
	(p, q, r) = (0, 0, 0)
	for i in range(1, n - 1):
		if l[i] + l[i - 1] <= c:
			(p, q) = (i, i - 1)
			ok = True
	if ok:
		print(q + 1, p + 1, n)
	else:
		print('-1')


t = int(input())
for _ in range(t):
	input()
	l = [int(i) for i in input().split()]
	ok = False
	if sum(l[:2]) > l[-1]:
		print(-1)
	else:
		print(1, 2, len(l))


from sys import stdin, stdout
import math
from itertools import permutations, combinations
from collections import defaultdict
from bisect import bisect_left
from bisect import bisect_right

def L():
	return list(map(int, stdin.readline().split()))

def In():
	return map(int, stdin.readline().split())

def I():
	return int(stdin.readline())
P = 1000000007

def main():
	for t in range(I()):
		n = I()
		arr = L()
		if arr[0] + arr[1] <= arr[n - 1]:
			print(1, 2, n)
		else:
			print(-1)
main()


def do():
	n = int(input())
	dat = list(map(int, input().split()))
	dat.sort()
	a = dat[0] + dat[1]
	for i in range(2, n):
		if dat[i] >= a:
			print(1, 2, i + 1)
			return
	print(-1)
q = int(input())
import bisect
for _ in range(q):
	do()


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(v) for v in input().split()]
	p = a[0]
	q = a[1]
	r = a[-1]
	if p + q <= r:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
while t > 0:
	n = int(input())
	arr = list(map(int, input().split()))
	flag = True
	sum = arr[0] + arr[1]
	for j in range(2, n):
		if sum <= arr[j]:
			flag = False
			break
	if flag == False:
		print(1, 2, j + 1)
	else:
		print(-1)
	t -= 1


from sys import stdin, stdout
from itertools import combinations
from collections import defaultdict, Counter
import math

def listIn():
	return list(map(int, stdin.readline().strip().split()))

def stringListIn():
	return [x for x in stdin.readline().split()]

def intIn():
	return int(stdin.readline())

def stringIn():
	return stdin.readline().strip()
t = intIn()
while t > 0:
	t -= 1
	n = intIn()
	a = listIn()
	f = 0
	s = a[0] + a[1]
	for i in range(2, n):
		if s <= a[i]:
			f = 1
			break
	if f:
		print(1, 2, i + 1)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = input()
	a = list(map(int, input().split()))
	x = a[0] + a[1]
	if x > a[int(n) - 1]:
		print(-1)
	else:
		l = ['1', '2', n]
		y = ' '.join(l)
		print(y)


import bisect
for t in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	for i in range(n - 2):
		first = arr[i]
		second = arr[i + 1]
		maxim_no = first + second
		if arr[-1] < maxim_no:
			print(-1)
			break
		else:
			print(i + 1, i + 2, n)
			break


t = int(input())
while t:
	t -= 1
	n = int(input())
	li = list(map(int, input().split()))
	i = 0
	j = 1
	k = len(li) - 1
	flag = 0
	while i < len(li) - 2:
		while j < len(li) - 1:
			while j < k:
				if li[i] + li[j] > li[k] and li[j] + li[k] > li[i] and (li[k] + li[i] > li[j]):
					pass
				else:
					flag = 1
					print(i + 1, j + 1, k + 1)
					break
				k -= 1
			j += 1
			if flag == 1:
				break
		i += 1
		if flag == 1:
			break
	if flag == 0:
		print(-1)


import math

def dtb(n):
	return bin(n).replace('0b', '')

def btd(n):
	return int(n, 2)
t = int(input())
for k in range(t):
	n = int(input())
	a = list(map(int, input().split()))[:n]
	(x, z) = (0, n - 1)
	flag = 0
	for i in range(1, n - 1):
		if a[i] + a[x] <= a[z] or a[i] + a[z] <= a[x] or a[x] + a[z] <= a[i]:
			print(x + 1, i + 1, z + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


from math import *
t = int(input())
while t:
	t = t - 1
	n = int(input())
	a = list(map(int, input().split()))
	s = a[0] + a[1]
	flag = 1
	for i in range(2, n):
		if s <= a[i]:
			print(1, 2, i + 1)
			flag = 0
			break
	if flag:
		print(-1)


t = int(input())
while t:
	t -= 1
	b = int(input())
	a = input().split(' ')
	if int(a[0]) + int(a[1]) > int(a[-1]):
		print(-1)
	else:
		print(1, 2, b)


from sys import stdin
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import os
import heapq
import sys, threading
import math
import bisect
import operator
from collections import defaultdict
sys.setrecursionlimit(10 ** 5)
from io import BytesIO, IOBase

def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a % b)

def power(x, p, m):
	res = 1
	while p:
		if p & 1:
			res = res * x % m
		x = x * x % m
		p >>= 1
	return res

def inar():
	return [int(k) for k in input().split()]

def lcm(num1, num2):
	return num1 * num2 // gcd(num1, num2)

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		arr = inar()
		if arr[0] + arr[1] <= arr[-1]:
			print(1, 2, n)
		else:
			print(-1)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


T = int(input())
for _ in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	a_i = A[0]
	a_j = A[1]
	ans = 0
	for k in range(2, N):
		if A[k] >= a_i + a_j:
			ans = k
			break
	if ans == 0:
		print(-1)
	else:
		print(1, 2, k + 1)


n = int(input())
for i in range(n):
	t = int(input())
	c = list(map(int, input().split()))
	g = c[0] + c[1]
	h = 0
	for j in range(2, t):
		if g <= c[j]:
			h = j
			break
	if h != 0:
		print(1, end=' ')
		print(2, end=' ')
		print(h + 1, end=' ')
		print()
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	arr = [i for i in map(int, input().split())]
	sorted(arr)
	if arr[0] + arr[1] <= arr[n - 1]:
		print(f'1 2 {n}')
	else:
		print(-1)


t = int(input())
dict = {}
for i in range(t):
	a = input()
	b = input().split(' ')
	m = len(b)
	for i in range(m):
		if int(b[0]) + int(b[1]) > int(b[m - 1]):
			print(-1)
			break
		else:
			print(1, 2, m)
			break


tests = int(input())
for test in range(tests):
	num = int(input())
	nums = list(map(int, input().split()))
	if nums[0] + nums[1] <= nums[-1]:
		print(1, 2, num)
	else:
		print(-1)


import sys
T = int(sys.stdin.readline())
for i in range(T):
	N = int(sys.stdin.readline())
	i = 0
	arr = list(map(int, sys.stdin.readline().split()))
	for i in range(2, N):
		if arr[0] + arr[1] <= arr[i]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


def bad_triangle(arr, n):
	s = arr[0] + arr[1]
	if s <= arr[n - 1]:
		print(1, 2, n)
	else:
		print(-1)
t = int(input())
for i in range(t):
	n = int(input())
	li = [int(x) for x in input().split()]
	bad_triangle(li, n)


import copy
import math
r = int(input())
for l in range(r):
	n = int(input())
	arr = [int(d) for d in input().split()]
	if arr[0] + arr[1] <= arr[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import sys

def inp():
	inp = input().split()
	if len(inp) == 1:
		return int(inp[0])
	else:
		return (int(i) for i in inp)

def inpl():
	inp = input().split()
	for i in range(len(inp)):
		inp[i] = int(inp[i])
	return inp
testcases = inp()
for testcase in range(testcases):
	found = False
	n = inp()
	s = inpl()
	if s[0] + s[1] <= s[-1]:
		print(1, 2, n)
	else:
		print(-1)


import atexit
import io
import sys
_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER

@atexit.register
def write():
	sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
for case in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


for i in ' ' * int(input()):
	n = int(input())
	a = list(map(int, input().split()))[:n]
	print(*([1, 2, n], [-1])[a[0] + a[1] > a[-1]])


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	x = max(a)
	b = sorted(a)
	y = b[0]
	z = b[1]
	if y + z <= x:
		m = a.index(x)
		a[m] = 0
		k = a.index(y)
		a[k] = 0
		l = a.index(z)
		s = [m + 1, k + 1, l + 1]
		print(*sorted(s))
	else:
		print(-1)


from collections import Counter
import sys
sys.setrecursionlimit(10 ** 6)
mod = 1000000007
inf = int(1e+18)
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]

def inverse(a):
	return pow(a, -1, mod)

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)

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


a = int(input())
for i in range(a):
	n = int(input())
	a = list(map(int, input().split()))
	res = []
	i = 0
	j = 1
	k = 2
	while k < len(a) and a[i] + a[j] > a[k]:
		k += 1
	if k == len(a):
		print(-1)
	else:
		print(i + 1, j + 1, k + 1)


for time in range(int(input())):
	l = int(input())
	op = []
	rt = input().split()
	op = rt
	for er in range(l):
		op[er] = int(op[er])
	x = op[0]
	y = op[1]
	z = op[-1]
	if z >= x + y:
		print(1, 2, l)
	else:
		print(-1)


t = int(input())
while t > 0:
	n = int(input())
	lis = [int(a) for a in input().split()]
	i = 0
	j = n - 1
	istrue = True
	while j >= 2 and istrue:
		while i <= j - 2 and istrue:
			if lis[j] >= lis[i] + lis[i + 1]:
				print(i + 1, i + 2, j + 1)
				istrue = False
				break
			i += 1
		j -= 1
	if istrue:
		print(-1)
	t -= 1


from collections import defaultdict
for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


def main():
	for _ in range(int(input())):
		s = int(input())
		l = [int(i) for i in input().split()]
		if l[0] + l[1] > l[-1]:
			print(-1)
		else:
			print(1, 2, s)
main()


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	i = 2
	while i < n:
		if a[i] >= a[0] + a[1]:
			break
		i += 1
	if i == n:
		print(-1)
	else:
		print(1, 2, i + 1)


import sys
from collections import defaultdict as dd
from collections import deque
from functools import *
from fractions import Fraction as f
from copy import *
from bisect import *
from heapq import *
from math import *
from itertools import permutations

def eprint(*args):
	print(*args, file=sys.stderr)
zz = 1
if zz:
	input = sys.stdin.readline
else:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('all.txt', 'w')

def inc(d, c):
	d[c] = d[c] + 1 if c in d else 1

def li():
	return [int(xx) for xx in input().split()]

def fli():
	return [float(x) for x in input().split()]

def comp(a, b):
	if a > b:
		return 2
	return 2 if a == b else 0

def gi():
	return [xx for xx in input().split()]

def fi():
	return int(input())

def pro(a):
	return reduce(lambda a, b: a * b, a)

def swap(a, i, j):
	(a[i], a[j]) = (a[j], a[i])

def si():
	return list(input().rstrip())

def mi():
	return map(int, input().split())

def gh():
	sys.stdout.flush()

def isvalid(i, j):
	return 0 <= i < n and 0 <= j < n

def graph(n, m):
	for i in range(m):
		(x, y) = mi()
		a[x].append(y)
		a[y].append(x)
t = fi()
while t > 0:
	t -= 1
	n = fi()
	a = li()
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
import os
import math
import copy
from math import gcd
from bisect import bisect
from io import BytesIO, IOBase
from math import sqrt, floor, factorial, gcd, log, ceil
from collections import deque, Counter, defaultdict
from itertools import permutations, combinations
import itertools

def Int():
	return int(sys.stdin.readline())

def Mint():
	return map(int, sys.stdin.readline().split())

def Lstr():
	return list(sys.stdin.readline().strip())

def Str():
	return sys.stdin.readline().strip()

def Mstr():
	return map(str, sys.stdin.readline().strip().split())

def List():
	return list(map(int, sys.stdin.readline().split()))

def Hash():
	return dict()

def Mod():
	return 1000000007

def Ncr(n, r, p):
	return fact[n] * (ifact[r] * ifact[n - r] % p) % p

def Most_frequent(list):
	return max(set(list), key=list.count)

def Mat2x2(n):
	return [List() for _ in range(n)]

def Lcm(x, y):
	return x * y // gcd(x, y)

def dtob(n):
	return bin(n).replace('0b', '')

def btod(n):
	return int(n, 2)

def common(l1, l2):
	return set(l1).intersection(l2)

def solution():
	for _ in range(Int()):
		n = Int()
		a = List()
		if a[0] + a[1] <= a[-1]:
			print(1, 2, n)
		else:
			print(-1)
solution()


T = int(input())
for t in range(T):
	N = int(input())
	lst = list(map(int, input().split()))
	if lst[0] + lst[1] > lst[N - 1]:
		print('-1')
	else:
		print('1 2 ', N)


def check(a, b, c):
	l = [a, b, c]
	l.sort()
	if l[0] + l[1] > l[2]:
		return False
	return True
T = int(input())
for _ in range(T):
	n = int(input())
	arr = list(map(int, input().split()))
	if n <= 2:
		print(-1)
		continue
	if check(arr[0], arr[1], arr[-1]):
		print('%d %d %d' % (1, 2, n))
	else:
		print(-1)


import math
t = input()
t = int(t)
while t > 0:
	n = input()
	n = int(n)
	s = input()
	s = [int(x) for x in s.split()]
	if s[0] + s[1] > s[-1]:
		print(-1)
	else:
		print(1, 2, n)
	t -= 1


for _ in [*open(0)][2::2]:
	arr = list(map(int, _.split()))
	if arr[0] + arr[1] <= arr[-1]:
		print(f'{1} {2} {len(arr)}')
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	m = list(map(int, input().split()))
	if n < 3:
		rez = -1
	elif m[0] + m[1] > m[-1]:
		rez = -1
	else:
		rez = (1, 2, len(m))
	if rez == -1:
		print(rez)
	else:
		print(*rez)


from collections import Counter
import heapq
from collections import Counter
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


from sys import stdin
t = int(input())
for T in range(t):
	n = int(input())
	arr = [int(x) for x in stdin.readline().split()]
	flag = 0
	for i in range(n - 2):
		for k in range(2, n):
			if arr[i] + arr[i + 1] <= arr[k]:
				print(i + 1, i + 2, k + 1)
				flag = 1
				break
		if flag == 1:
			break
		elif flag == 0:
			print(-1)
			break


from sys import stdin, gettrace
if gettrace():
	inputi = input
else:

	def input():
		return next(stdin)[:-1]

	def inputi():
		return stdin.buffer.readline()

def solve():
	n = int(inputi())
	aa = [int(a) for a in inputi().split()]
	if aa[0] + aa[1] <= aa[-1]:
		print(1, 2, n)
	else:
		print(-1)

def main():
	t = int(inputi())
	for _ in range(t):
		solve()
main()


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	ans = []
	flag = 0
	for j in range(2, n):
		if l[0] + l[1] <= l[j]:
			flag = 1
			ans = [1, 2, j + 1]
			break
	if flag == 1:
		print(*ans)
	else:
		print(-1)


T = int(input())

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print('%d %d %d' % (1, 2, n))
	else:
		print(-1)
for t in range(T):
	solve()


from sys import stdin

def inp():
	return stdin.buffer.readline().rstrip().decode('utf8')

def itg():
	return int(stdin.buffer.readline())

def mpint():
	return map(int, stdin.buffer.readline().split())
for case in range(1, itg() + 1):
	n = itg()
	arr = tuple(mpint())
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	ok = False
	for i in range(1, n - 1):
		if a[i - 1] + a[i] <= a[-1]:
			print(i, i + 1, n)
			ok = True
			break
	if not ok:
		print(-1)


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a = 0
	b = 1
	c = 2
	knt = 0
	while c < n:
		if l[a] + l[b] <= l[c]:
			print(a + 1, b + 1, c + 1)
			knt = 1
			break
		c += 1
	if knt == 0:
		print('-1')


from itertools import combinations

def stdin(t):
	for _ in range(t):
		n = int(input())
		a = [int(x) for x in input().split()]
		print(main(a, n))

def main(a, n):
	if a[n - 1] >= a[0] + a[1]:
		return '{} {} {}'.format(1, 2, n)
	return -1
stdin(int(input()))


w = int(input())
a = []
for i in range(w):
	t = input()
	p = input().split()
	a.append(p)
for i in range(w):
	o = 0
	r = a[i]
	for j in range(2, len(r)):
		if int(r[0]) + int(r[1]) <= int(r[j]):
			o = j + 1
	if o >= 3:
		print(*[1, 2, o])
	else:
		print(-1)


from sys import stdin, stdout
from collections import Counter, OrderedDict
import math
cin = stdin.readline
cout = stdout.write
mp = lambda : list(map(int, cin().split()))

def chars():
	s = cin()
	return list(s[:len(s) - 1])

def pl(a):
	for val in a:
		cout(str(val) + ' ')
	cout('\n')
(t,) = mp()
for _ in range(t):
	(n,) = mp()
	a = mp()
	if a[0] + a[1] > a[-1]:
		cout('-1\n')
	else:
		pl([1, 2, n])


import sys
input = sys.stdin.readline
T = int(input())
for _ in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	a = A[0]
	b = A[1]
	c = A[N - 1]
	if a + b <= c or a + c <= b or b + c <= a:
		print(1, 2, N)
	else:
		print(-1)


T = int(input())
while T > 0:
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[n - 1]:
		print(-1)
	else:
		print(1, 2, n)
	T -= 1


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	f = False
	s = a[0] + a[1]
	if s <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for o in range(0, t):
	n = int(input())
	arr = list(map(int, input().split(' ')))
	sum = arr[0] + arr[1]
	flag = 0
	for i in range(2, n):
		if arr[i] >= sum:
			print('{} {} {}'.format(1, 2, i + 1))
			flag = 1
			break
	if flag == 0:
		print('-1')


t = int(input())
for i in range(t):
	s = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] > l[-1]:
		ans = []
		for j in range(0, s - 2):
			if l[j] + l[j + 1] <= l[j + 2]:
				ans = [j + 1, j + 2, j + 3]
				break
		if ans == []:
			print(-1)
		else:
			print(*ans)
	else:
		print(1, 2, s)


t = int(input())
while t > 0:
	n = int(input())
	a = list(map(int, input().split()))
	i = 0
	k = n - 1
	j = -1
	for it in range(1, n - 1):
		if a[i] + a[it] <= a[k]:
			j = it
			break
	if j == -1:
		print(-1)
	else:
		print(i + 1, j + 1, k + 1)
	t -= 1


for _ in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	br = ar.copy()
	ar.sort()
	a = br.index(ar[0])
	br[a] = 10 ** 9 + 52
	b = br.index(ar[1])
	br[b] = 10 * 6 - 6
	if len(ar) < 3:
		print(-1)
	else:
		c = ar[0] + ar[1]
		flag = 0
		ans = 0
		for i in range(2, len(ar)):
			if ar[i] >= c:
				flag = 1
				ans = ar[i]
				break
		if flag == 1:
			c = br.index(ans)
			print(a + 1, b + 1, c + 1)
		else:
			print(-1)


def subString(test_str):
	res = [test_str[i:j] for i in range(len(test_str)) for j in range(i + 1, len(test_str) + 1)]
	return res
for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] > l[n - 1]:
		print(-1)
	else:
		print('{} {} {}'.format(1, 2, n))


t = int(input())
for i in range(t):
	n = int(input())
	arr = [int(k) for k in input().split()]
	found = False
	k = 2
	for j in range(n - 2):
		while k < n and arr[j] + arr[j + 1] > arr[k]:
			k += 1
		if k < n:
			print(j + 1, j + 2, k + 1)
			found = True
			break
	if not found:
		print(-1)


def solve():
	n = int(input())
	l = [int(x) for x in input().split()]
	for i in range(2, n):
		if l[0] + l[1] <= l[i]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)
for _ in range(int(input())):
	solve()


from sys import stdin, stdout
from bisect import bisect
test = int(stdin.readline())
for _ in range(test):
	n = int(stdin.readline())
	a = [int(x) for x in stdin.readline().split()]
	ok = False
	for i in range(n - 1):
		if a[i] + a[i + 1] <= a[-1]:
			print(i + 1, i + 2, n)
			ok = True
			break
	if not ok:
		print(-1)


for t in range(int(input())):
	n = int(input())
	nums = list(map(int, input().split()))
	a = sorted(nums)
	a1 = 0
	a2 = 0
	a3 = 0
	if a[0] + a[1] <= a[n - 1]:
		c = 0
		for i in range(n):
			if nums[i] == a[0] and a1 == 0:
				a1 = 1
				c += 1
				print(i + 1, end=' ')
			elif nums[i] == a[1] and a2 == 0:
				a2 = 1
				c += 1
				print(i + 1, end=' ')
			elif nums[i] == a[n - 1] and a3 == 0:
				a3 = 1
				c += 1
				print(i + 1, end=' ')
			if c == 3:
				print()
				break
	else:
		print('-1')


import sys
from sys import stdin
import math

def iinput():
	return int(input())

def minput():
	return map(int, input().split())

def linput():
	return list(map(int, input().split()))

def fiinput():
	return int(stdin.readline())

def fminput():
	return map(int, stdin.readline().strip().split())

def flinput():
	return list(map(int, stdin.readline().strip().split()))
for _ in range(iinput()):
	n = iinput()
	list1 = linput()
	x = list1[0]
	y = list1[1]
	z = list1[-1]
	if x + y <= z:
		print(1, 2, n)
	else:
		print(-1)


import time, math as mt, bisect as bs, sys
from sys import stdin, stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi = 3.141592653589793

def II():
	return int(stdin.readline())

def IP():
	return map(int, stdin.readline().split())

def L():
	return list(map(int, stdin.readline().split()))

def P(x):
	return stdout.write(str(x) + '\n')

def PI(x, y):
	return stdout.write(str(x) + ' ' + str(y) + '\n')

def lcm(a, b):
	return a * b // gcd(a, b)

def gcd(a, b):
	if a == 0:
		return b
	elif b == 0:
		return a
	if a > b:
		return gcd(a % b, b)
	else:
		return gcd(a, b % a)

def bfs(adj, v):
	visited = [False] * (v + 1)
	q = deque()
	while q:
		pass

def sieve():
	li = [True] * (2 * 10 ** 5 + 5)
	(li[0], li[1]) = (False, False)
	for i in range(2, len(li), 1):
		if li[i] == True:
			for j in range(i * i, len(li), i):
				li[j] = False
	prime = []
	for i in range(2 * 10 ** 5 + 5):
		if li[i] == True:
			prime.append(i)
	return prime

def setBit(n):
	count = 0
	while n != 0:
		n = n & n - 1
		count += 1
	return count
mx = 10 ** 7
spf = [mx] * (mx + 1)

def SPF():
	spf[1] = 1
	for i in range(2, mx + 1):
		if spf[i] == mx:
			spf[i] = i
			for j in range(i * i, mx + 1, i):
				if i < spf[j]:
					spf[j] = i
	return

def readTree(n, e):
	adj = [set() for i in range(n + 1)]
	for i in range(e):
		(u1, u2) = IP()
		adj[u1].add(u2)
	return adj
mod = 10 ** 9 + 7

def solve():
	n = II()
	li = L()
	(a, b, c) = (li[0], li[1], li[-1])
	if a < b + c and b < a + c and (c < a + b):
		print(-1)
	else:
		print(1, 2, n)
	return
t = II()
for i in range(t):
	solve()


from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
	return int(input())

def rl():
	return list(map(int, input().split()))

def solve():
	n = ri()
	A = rl()
	L = [[a, i + 1] for (i, a) in enumerate(A)]
	L.sort()
	if L[0][0] + L[1][0] <= L[-1][0]:
		print(L[0][1], L[1][1], L[-1][1])
	else:
		print(-1)
mode = 'T'
if mode == 'T':
	t = ri()
	for i in range(t):
		solve()
else:
	solve()


t = int(input())
for i in range(t):
	N = int(input())
	arr = [int(x) for x in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, N)
	else:
		print(-1)


import sys
import math
from sys import stdin, stdout

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()

def main():
	for t in range(int(input())):
		n = int(input())
		l = get_list()
		if l[0] + l[1] <= l[n - 1]:
			print(1, 2, n)
		else:
			print(-1)
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		a = list(map(int, input().split()))
		(x, y) = (a[0], a[1])
		z = x + y
		ans = 0
		for i in range(2, n):
			if a[i] >= z:
				ans = i + 1
				break
		if ans == 0:
			print(-1)
		else:
			print(1, 2, ans)
main()


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(i) for i in input().split()]
	b = []
	for (i, val) in enumerate(a):
		b.append((val, i))
	b.sort()
	i = b[0][1]
	j = b[1][1]
	k = b[n - 1][1]
	if a[k] < a[i] + a[j] and a[j] - a[i] < a[k]:
		print(-1)
	else:
		print(i + 1, j + 1, k + 1)


t = int(input())
for _ in range(t):
	n = int(input())
	num = list(map(int, input().split()))
	if num[0] + num[1] > num[n - 1]:
		print('-1')
	else:
		print('{} {} {}'.format(1, 2, n))


n1 = int(input())
for test in range(n1):
	n = int(input())
	set1 = [int(y) for y in input().split()]
	m = set1[0] + set1[1]
	booli = False
	track = 0
	for i in range(2, n):
		if set1[i] >= m:
			track = i + 1
			break
	if track != 0:
		print('1 ' + '2 ' + str(track))
	else:
		print(-1)


answers = []
for _ in range(int(input())):
	n = input()
	a = list(map(int, input().strip().split(' ')))
	if a[0] + a[1] <= a[-1]:
		answers.append('1 2 {}'.format(len(a)))
	else:
		answers.append('-1')
for answer in answers:
	print(answer)


a = int(input())
for x in range(a):
	b = int(input())
	c = list(map(int, input().split()))
	c.sort()
	if c[0] + c[1] > c[b - 1]:
		print(-1)
	else:
		print(1, 2, b)


from sys import stdin, stdout
import math
input = stdin.readline

def print(*args, end='\n'):
	s = []
	for i in args:
		s.append(str(i) + ' ')
	s = ''.join(s)
	stdout.write(s + end)

def solve():
	n = int(input())
	l = list(map(int, input().split()))
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)
tt = 1
tt = int(input())
for __ in range(tt):
	solve()


t = int(input())
for aaa in range(t):
	m = int(input())
	a = [int(aaa) for aaa in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, m)
	else:
		print(-1)


import sys
import random
from fractions import Fraction
from math import *

def input():
	return sys.stdin.readline().strip()

def iinput():
	return int(input())

def finput():
	return float(input())

def tinput():
	return input().split()

def linput():
	return list(input())

def rinput():
	return map(int, tinput())

def fiinput():
	return map(float, tinput())

def flinput():
	return list(fiinput())

def rlinput():
	return list(map(int, input().split()))

def trinput():
	return tuple(rinput())

def srlinput():
	return sorted(list(map(int, input().split())))

def NOYES(fl):
	if fl:
		print('NO')
	else:
		print('YES')

def YESNO(fl):
	if fl:
		print('YES')
	else:
		print('NO')

def main():
	n = iinput()
	q = rlinput()
	m2 = q.index(max(q))
	mm2 = max(q)
	m = q.index(min(q))
	mm1 = min(q)
	del q[m]
	m1 = q.index(min(q))
	if m1 >= m:
		m1 += 1
	q.sort()
	if mm1 + min(q) <= mm2:
		print(*sorted([m + 1, m1 + 1, m2 + 1]))
	else:
		print(-1)
for TESTING in range(iinput()):
	main()


t = int(input())
for T in range(t):
	p = 0
	n = int(input())
	l = list(map(int, input().split()))
	s = l[0] + l[1]
	for i in range(2, n):
		if l[i] >= s:
			p = i + 1
			break
	if p == 0:
		print(-1)
	else:
		print('1 2', p)


t = int(input())
sol = []
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	j = l.copy()
	x = min(j)
	j.remove(x)
	y = min(j)
	z = max(j)
	if x + y <= z:
		if x == y:
			x = l.index(x) + 1
			l.remove(y)
			y = l.index(y) + 2
			z = l.index(z) + 2
		else:
			x = l.index(x) + 1
			y = l.index(y) + 1
			z = l.index(z) + 1
		sol.append(str(x) + ' ' + str(y) + ' ' + str(z))
	else:
		sol.append('-1')
for i in sol:
	print(i)


for _ in range(int(input())):
	r = int(input()) - 1
	k = input().split()
	if int(k[0]) + int(k[1]) > int(k[r]):
		print(-1)
	else:
		print('1', '2', str(r + 1))


for T in range(int(input())):
	input()
	A = list(map(int, input().split()))
	if A[0] + A[1] <= A[-1]:
		print(1, 2, len(A))
	else:
		print(-1)


def f():
	n = int(input())
	a = [int(i) for i in input().split()]
	for i in range(2, n):
		if a[0] + a[1] <= a[i]:
			print(1, 2, i + 1)
			return
	print(-1)
for _ in range(int(input())):
	f()


def solve(arr):
	n = len(arr)
	if arr[0] + arr[1] <= arr[-1]:
		return [1, 2, n]
	return -1
t = int(input())
while t:
	n = int(input())
	arr = list(map(int, input().split()))
	res = solve(arr)
	if res == -1:
		print(-1)
	else:
		print(' '.join(list(map(str, res))))
	t -= 1


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().strip().split(' ')))
	p = a[0]
	q = a[1]
	r = a[n - 1]
	if p + q > r and p + r > q and (q + r > p):
		print(-1)
	else:
		print(1, 2, n)


from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush, heappop, heapify
import math
from collections import *
from functools import reduce, cmp_to_key
import sys
input = sys.stdin.readline
from itertools import accumulate
from functools import lru_cache
M = mod = 998244353

def factors(n):
	return sorted(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def inv_mod(n):
	return pow(n, mod - 2, mod)

def li():
	return [int(i) for i in input().rstrip('\n').split()]

def st():
	return input().rstrip('\n')

def val():
	return int(input().rstrip('\n'))

def li2():
	return [i for i in input().rstrip('\n')]

def li3():
	return [int(i) for i in input().rstrip('\n')]
for _ in range(val()):
	n = val()
	l = li()
	ans = [-1]
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
cnt = 0
while cnt < t:
	cnt += 1
	n = int(input())
	flag = False
	a = [int(i) for i in input().split()]
	if a[0] + a[1] <= a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import math
import os
import random
import re
import sys
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, n)


for _ in range(int(input())):
	rets = [-1]
	lens = int(input())
	arrs = sorted([int(x) for x in input().split()])
	if arrs[0] + arrs[1] <= arrs[-1]:
		rets = [1, 2, lens]
	print(*rets)


query = int(input())
for _ in range(query):
	n = int(input())
	a = list(map(int, input().split()))
	ma = max(a)
	mi = min(a)
	flag = 0
	for i in range(1, n - 1):
		if a[0] + a[i] <= a[n - 1]:
			flag = 1
			break
	if flag == 1:
		print(1, i + 1, n)
	else:
		print(-1)


n = int(input())
for i in range(n):
	m = int(input())
	nums = list(map(int, input().split()))
	if nums[0] + nums[1] > nums[m - 1]:
		print('-1')
	else:
		print('1 2 ' + str(m))


def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		a = list(map(int, input().split()))
		ok = 0
		for (i, v) in enumerate(a[2:]):
			if v >= a[0] + a[1]:
				print(1, 2, i + 3)
				ok = 1
				break
		if not ok:
			print(-1)
	return
main()


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
(t,) = I()
for _ in range(t):
	(n,) = I()
	l = I()
	an = -1
	i = 0
	if n >= 3 and l[i] + l[i + 1] <= l[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	lst = list(map(int, input().split()))
	(a, b, c) = [1, 2, -1]
	end = False
	for i in range(2, n):
		if lst[a - 1] + lst[b - 1] <= lst[i] or lst[a - 1] + lst[i] <= lst[b - 1] or lst[b - 1] + lst[i] <= lst[a - 1]:
			end = True
			print(a, b, i + 1)
			break
	if not end:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	mi = min(a)
	mii = a.index(mi)
	ma = max(a)
	mai = a.index(ma)
	fl = False
	i = -1
	for i in range(len(a)):
		if i != mai and i != mii and (mi + a[i] <= ma):
			fl = True
			break
	b = [mii + 1, mai + 1, i + 1]
	b.sort()
	if fl:
		print(b[0], b[1], b[2])
	else:
		print(-1)


res = ''
for _ in range(int(input())):
	n = int(input())
	side_lengths = tuple(map(int, input().split()))
	if side_lengths[0] + side_lengths[1] <= side_lengths[n - 1]:
		res += '1 2 %d\n' % n
	else:
		res += '-1\n'
print(res)


for i in range(int(input())):
	n = int(input())
	lst = list(map(int, input().split()))
	A = lst
	A.sort()
	a1 = []
	b = 1
	first = A[0]
	second = A[1]
	for i in range(2, n):
		if first + second <= A[i] or first + A[i] <= second or second + A[i] <= first:
			print(1, 2, i + 1)
			b = 0
			break
	if b == 1:
		print(-1)


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	i = 0
	y = 1
	for z in range(2, n):
		if a[i] + a[y] <= a[z]:
			break
	if i == z or a[i] + a[y] > a[z]:
		print(-1)
	else:
		print(i + 1, y + 1, z + 1)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	x = a[0]
	y = a[1]
	c = 0
	k = 0
	for i in range(2, n):
		if x + y <= a[i]:
			c = 0
			k = i
			break
		else:
			c = c + 1
	if c == 0:
		print(1, 2, k + 1)
	else:
		print(-1)


def f(n, l):
	for i in range(l - 2):
		for ii in range(1, l - 1):
			for iii in range(2, l):
				if n[iii] >= n[ii] + n[i]:
					return (i + 1, ii + 1, iii + 1)
			return [-1]
for _ in range(int(input())):
	l = int(input())
	n = [int(x) for x in input().split()]
	print(*f(n, l))


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	flag = 0
	min = a[0] + a[1]
	for i in range(2, len(a)):
		if min <= a[i]:
			print(1, 2, i + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


import sys, collections, math

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def input():
	return sys.stdin.readline().strip()
mod = 1000000007
for _ in range(int(input())):
	n = int(input())
	arr = get_array()
	flag = False
	if arr[0] + arr[1] > arr[n - 1]:
		if arr[1] + arr[n - 1] > arr[0]:
			if arr[n - 1] + arr[0] > arr[1]:
				print(-1)
			else:
				print(1, 2, n)
		else:
			print(1, 2, n)
	else:
		print(1, 2, n)


t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	m = l[0] + l[1]
	flag = False
	for i in range(2, n):
		if m <= l[i]:
			print(1, 2, i + 1)
			flag = True
			break
	if not flag:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	(*a,) = map(int, input().split())
	ai = [(a[i], i + 1) for i in range(n)]
	ai.sort()
	if ai[0][0] + ai[1][0] <= ai[-1][0]:
		print(ai[0][1], ai[1][1], ai[-1][1])
	else:
		print(-1)


(z, zz) = (input, lambda : list(map(int, z().split())))
(szz, dgraphs, mod) = (lambda : sorted(zz()), {}, 10 ** 9 + 7)
from string import *
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
from itertools import *
from bisect import *
from collections import Counter as cc
from math import factorial as f
from bisect import bisect as bs
from itertools import accumulate as ac

def lcd(xnum1, xnum2):
	return xnum1 * xnum2 // gcd(xnum1, xnum2)

def prime(x):
	p = ceil(x ** 0.5) + 1
	for i in range(2, p):
		if x % i == 0 and x != 2:
			return 0
	return 1

def dfs(u, visit, graph):
	visit[u] = True
	for i in graph[u]:
		if not visit[i]:
			dfs(i, visit, graph)
num = int(z())
for _ in range(num):
	n = int(z())
	l = zz()
	a = l[0]
	b = l[1]
	c = l[-1]
	if a + b > c and b + c > a and (a + c > b):
		print(-1)
	else:
		print(1, 2, n)


from sys import stdin
from collections import deque
mod = 10 ** 9 + 7
import sys
import random
sys.setrecursionlimit(10 ** 6)
from queue import PriorityQueue
from collections import Counter as cc
from bisect import bisect_right
from bisect import bisect_left
from collections import defaultdict
from math import sqrt, factorial, gcd, log2, inf, ceil
import heapq
from collections import deque
mod = 10 ** 9 + 7
import sys
import random
sys.setrecursionlimit(10 ** 6)
from queue import PriorityQueue
from collections import Counter as cc
from bisect import bisect_right
from bisect import bisect_left
from collections import defaultdict
from math import sqrt, factorial, gcd, log2, inf, ceil
import heapq
input = lambda : sys.stdin.readline().rstrip()
from sys import stdin, stdout
from heapq import heapify, heappush, heappop
from itertools import permutations
from math import factorial as f

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p
import sys
from sys import stdin, stdout
from heapq import heapify, heappush, heappop
from itertools import permutations
from math import factorial as f

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p
import sys
t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	(i, j, k) = (1, 2, -1)
	for K in range(3, n + 1):
		if l[K - 1] >= l[i - 1] + l[j - 1]:
			k = K
			break
	if k == -1:
		print(-1)
	else:
		print(i, j, k)


for _ in range(int(input())):
	n = int(input())
	data = [int(x) for x in input().split()]
	if data[0] + data[1] <= data[n - 1]:
		print(1, 2, n)
	elif data[n - 1] - data[n - 2] >= data[0]:
		print(1, n - 1, n)
	else:
		print(-1)


from functools import reduce
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import *
from io import BytesIO, IOBase
input = lambda : sys.stdin.readline().rstrip('\r\n')

def value():
	return tuple(map(int, input().split()))

def arr():
	return [int(i) for i in input().split()]

def sarr():
	return [int(i) for i in input()]

def inn():
	return int(input())
mo = 1000000007
for _ in range(int(input())):
	n = inn()
	a = arr()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	x = int(input())
	ar = list(map(int, input().split()))
	if ar[len(ar) - 1] >= ar[0] + ar[1]:
		print(f'1 2 {len(ar)}')
	else:
		print(-1)


def multi_input():
	return map(int, input().split())

def array_print(arr):
	print(' '.join(map(str, arr)))
for i in range(int(input())):
	n = int(input())
	arr = list(multi_input())
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


from sys import stdin, stdout
from collections import Counter
from itertools import permutations
import bisect
import math
I = lambda : map(int, stdin.readline().split())
I1 = lambda : stdin.readline()
for _ in range(int(I1())):
	n = int(I1())
	l = list(I())
	(x, y, z) = (l[0], l[1], l[n - 1])
	if x + y > z:
		print(-1)
	else:
		print(1, 2, n)


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
mod2 = 998244353
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def JA(a, sep):
	return sep.join(map(str, a))

def JAA(a, s, t):
	return s.join((t.join(map(str, b)) for b in a))

def main():
	t = I()
	rr = []
	for _ in range(t):
		n = I()
		a = LI()
		if a[0] + a[1] <= a[-1]:
			rr.append(JA([1, 2, n], ' '))
		else:
			rr.append(-1)
	return JA(rr, '\n')
print(main())


t = int(input())
while t:
	n = int(input())
	a = list(map(int, input().split()))
	(b, c, e) = (a[0], a[1], a[-1])
	if b + c <= e:
		print('1 2 %d' % n)
	else:
		print('-1')
	t -= 1


import os
import sys
from collections import Counter
from io import BytesIO, IOBase

def main():
	input = sys.stdin.readline
	for t in range(int(input())):
		n = int(input())
		a = list(map(int, input().split()))
		b = [1, 2]
		for i in range(2, n):
			if a[i] >= a[0] + a[1]:
				b.append(i + 1)
				break
		if len(b) == 2:
			print(-1)
		else:
			print(*b)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


t = int(input())
while t > 0:
	n = int(input())
	g = list(map(int, input().split()))
	if g[0] + g[1] <= g[n - 1]:
		print('1 2 {}'.format(n))
	else:
		print(-1)
	t -= 1


try:
	for _ in range(int(input())):
		a = int(input())
		b = list(map(int, input().split()))
		i = 0
		k = a - 1
		flag = True
		j = a - 2
		while flag and i < j and (j < k):
			temp = b[k] - b[i]
			if b[j] <= temp:
				print(i + 1, j + 1, k + 1)
				flag = False
			else:
				j -= 1
		if flag:
			print(-1)
except Exception as e:
	print(e)


def compute_lcm(num1, num2):
	if num1 > num2:
		num = num1
		den = num2
	else:
		num = num2
		den = num1
	rem = num % den
	while rem != 0:
		num = den
		den = rem
		rem = num % den
	gcd = den
	lcm = int(int(num1 * num2) / int(gcd))
	return lcm
t = int(input())
import math
import collections
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	s = a[0] + a[1]
	for i in range(2, n):
		if s > a[i]:
			continue
		else:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


for _ in range(int(input())):
	temp = input()
	arr = list(map(int, input().split()))
	arr.sort()
	if arr[0] + arr[1] <= arr[-1]:
		print('%d %d %d' % (1, 2, len(arr)))
	else:
		print('-1')


t = int(input())
for tt in range(t):
	n = int(input())
	a = [int(x) for x in input().split(' ')]
	a.sort()
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
flag = bool(False)
for q in range(t):
	a = []
	flag = False
	c = int(input())
	a = list(map(int, input().split()))
	for e in range(1, c - 1):
		if a[0] + a[e] <= a[c - 1]:
			flag = True
			break
	if flag == True:
		print(1, e + 1, c)
	else:
		print(-1)


t = int(input())
while t:
	n = int(input())
	arr = list(map(int, input().split()))
	flag1 = 0
	index = n - 1
	if arr[0] + arr[1] <= arr[n - 1]:
		print(1, 2, n)
	else:
		print(-1)
	t -= 1


import math
test = int(input())
for t in range(test):
	n = int(input())
	A = list(map(int, input().split()))
	a = A[0] + A[1]
	if A[-1] >= a:
		print(1, 2, n)
	else:
		print('-1')


def checkinvalidity(a, b, c):
	if a + b <= c or a + c <= b or b + c <= a:
		return True
	else:
		return False
for _ in range(int(input())):
	count = 0
	n = int(input())
	arr = list(map(int, input().split()))
	for i in range(n - 2):
		a = arr[i]
		b = arr[i + 1]
		c = arr[n - i - 1]
		if checkinvalidity(a, b, c):
			print(i + 1, i + 2, n - i)
			count += 1
			break
	if count == 0:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	a = [int(s) for s in input().split()]
	ans = '-1'
	if a[0] + a[1] <= a[-1]:
		ans = str(1) + ' ' + str(2) + ' ' + str(n)
	print(ans)


t = int(input())
for i in range(0, t):
	n = int(input())
	l = list(map(int, input().split()))
	a = l[0]
	c = l[n - 1]
	b = False
	for i in range(1, n - 1):
		if a + l[i] <= c:
			b = i + 1
			break
	if b:
		print('1', b, n)
	else:
		print(-1)


from math import *
from collections import deque
from copy import deepcopy
import sys

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def multi():
	return map(int, input().split())

def strmulti():
	return map(str, inp().split())

def lis():
	return list(map(int, inp().split()))

def lcm(a, b):
	return a * b // gcd(a, b)

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def stringlis():
	return list(map(str, inp().split()))

def out(var):
	sys.stdout.write(str(var))

def printlist(a):
	print(' '.join((str(a[i]) for i in range(len(a)))))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True
t = int(inp())
for _ in range(t):
	n = int(input())
	a = lis()
	if a[0] + a[1] > a[-1]:
		print(-1)
		continue
	print(1, 2, n)


def check(l):
	for (i, a1) in enumerate(l[:-2]):
		a2 = l[i + 1]
		s = a1 + a2
		if s <= l[-1]:
			return [i, i + 1, len(l) - 1]
	return [-2]
t = int(input())
for i in range(t):
	n = int(input())
	l = input().split(' ')
	l = list(map(int, l))
	res = check(l)
	for m in res[:-1]:
		print(m + 1, end=' ')
	print(res[-1] + 1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	i = 0
	j = 1
	k = 2
	breaked = False
	while i < n and j < n:
		if a[i] + a[j] <= a[k]:
			print(i + 1, j + 1, k + 1)
			breaked = True
			break
		if k < n - 1:
			k += 1
		elif j < n - 2:
			j += 1
		else:
			i += 1
	if not breaked:
		print(-1)


def process():
	n = int(input())
	li = list(map(int, input().split()))
	li.sort()
	hashi = {}
	c0 = 1
	for i in li:
		if i in hashi:
			hashi[i].append(c0)
		else:
			hashi[i] = [c0]
		c0 += 1
	(a, b, c) = (li[0], li[1], li[-1])
	if a + b > c:
		print('-1')
	else:
		ans = [hashi[a].pop(), hashi[b].pop(), hashi[c].pop()]
		ans.sort()
		print(ans[0], ans[1], ans[2])
tests = int(input())
for i in range(tests):
	process()


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	flag = 0
	for i in range(1, n):
		t = arr[i] + arr[i - 1]
		if i != n - 1:
			if arr[n - 1] >= t:
				flag = 1
				print(i, i + 1, n)
				break
	if flag == 0:
		print(-1)


n = int(input())
a = []
b = []
for i in range(n):
	s = input()
	a.append(list(map(int, input().split())))
	a[-1].sort()
	if a[-1][0] + a[-1][1] > a[-1][-1]:
		print(-1)
	else:
		print(1, 2, len(a[i]))


for u in range(int(input())):
	n = int(input())
	x = [int(w) for w in input().split()]
	if x[0] + x[1] > x[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
ans = []
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		ans.append([0, 1, len(a) - 1])
	else:
		ans.append(-1)
for i in range(t):
	if type(ans[i]) is list:
		for j in ans[i]:
			print(j + 1, end=' ')
		print()
	else:
		print(ans[i])


for i in [*open(0)][2::2]:
	(a, b, *d, c) = [*map(int, i.split())]
	if a + b > c:
		print(-1)
	else:
		print(1, 2, len([a] + [b] + d + [c]))


from math import *
import sys, random

def nextInt():
	return int(input())

def nextStrs():
	return input().split()

def nextInts():
	return list(map(int, nextStrs()))

def can(i, j, k):
	if i + j > k:
		return True
	return False

def main():
	t = nextInt()
	while t > 0:
		n = nextInt()
		arr = nextInts()
		if can(arr[0], arr[1], arr[n - 1]):
			print(-1)
		else:
			print(1, 2, n)
		t -= 1
exit(main())


MOD = 1000000007
from collections import defaultdict as dd, Counter, deque

def si():
	return input()

def ii():
	return int(input())

def li():
	return list(map(int, input().split()))

def mi():
	return map(int, input().split())

def out(v):
	print(v)

def spout():
	print(v, end=' ')

def d2b(n):
	return bin(n).replace('0b', '')

def twod(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def vow():
	return ['a', 'e', 'i', 'o', 'u']

def let():
	return [chr(i) for i in range(97, 123)]

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def ispow2(x):
	return x and (not x & x - 1)

def prime_factors(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return list(factors)
t = ii()
while t:
	t -= 1
	n = ii()
	a = li()
	if a[-1] >= a[0] + a[1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
read = lambda : sys.stdin.readline().strip()
for _ in range(int(read())):
	length = int(read())
	nums = list(map(int, read().split()))
	end = length - 1
	start = 0
	mid = start + 1
	a = nums[start]
	b = nums[mid]
	c = nums[end]
	if a + b <= c:
		print(start + 1, mid + 1, end + 1)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	sa = arr
	status = 0
	result = list()
	c = arr[len(arr) - 1]
	b = arr[0]
	a = arr[1]
	if a + b <= c:
		index1 = arr.index(a) + 1
		index2 = arr.index(b) + 1
		index3 = arr.index(c) + 1
		print(1, 2, len(arr))
	else:
		print(-1)


tc = int(input())
for _ in range(tc):
	n = int(input())
	arr = list(map(int, input().split()))
	(A, B) = (arr[0], arr[1])
	f = 1
	for i in range(2, n):
		C = arr[i]
		if A + B <= C or B + C <= A or C + A <= B:
			print(1, 2, i + 1)
			f = 0
			break
	if f:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(s) for s in input().split()]
	sum = a[0] + a[1]
	flag = 0
	j = 2
	while flag == 0:
		if sum <= a[j]:
			print(1, 2, j + 1)
			flag = 1
		if j == n - 1 and flag == 0:
			print(-1)
			flag = 1
		j += 1


t = int(input())
for x in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	b = list(a)
	max1 = max(a)
	a.remove(max1)
	min1 = min(a)
	a.remove(min1)
	min2 = min(a)
	a.remove(min2)
	if max1 >= min1 + min2:
		print(1, 2, len(b))
		continue
	a = b
	max1 = max(a)
	a.remove(max1)
	min1 = min(a)
	a.remove(min1)
	max2 = max(a)
	a.remove(min2)
	if max1 >= max2 + min1:
		print(1, len(b) - 1, len(b))
	else:
		print(-1)


def tc():
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)
T = int(input())
for _ in range(T):
	tc()


from sys import stdin, stdout, setrecursionlimit
from math import gcd, ceil, sqrt
from collections import Counter, deque
from bisect import bisect_left, bisect_right
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
setrecursionlimit(100000)
mod = 1000000007
tc = ii1()
for _ in range(tc):
	n = ii1()
	arr = iia()
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


def fact(x):
	if x == 0:
		return 1
	else:
		return x * fact(x - 1)

def lower_bound(li, num):
	answer = len(li) - 1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer

def upper_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] <= num:
			answer = middle
			start = middle + 1
		else:
			end = middle - 1
	return answer

def abs(x):
	return x if x >= 0 else -x

def binary_search(li, val, lb, ub):
	ans = 0
	while lb <= ub:
		mid = (lb + ub) // 2
		if li[mid] > val:
			ub = mid - 1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = 1
			break
	return ans

def sieve_of_eratosthenes(n):
	ans = []
	arr = [1] * (n + 1)
	(arr[0], arr[1], i) = (0, 0, 2)
	while i * i <= n:
		if arr[i] == 1:
			j = i + i
			while j <= n:
				arr[j] = 0
				j += i
		i += 1
	for k in range(n):
		if arr[k] == 1:
			ans.append(k)
	return ans

def nc2(x):
	if x == 1:
		return 0
	else:
		return x * (x - 1) // 2

def kadane(x):
	sum_so_far = 0
	current_sum = 0
	for i in x:
		current_sum += i
		if current_sum < 0:
			current_sum = 0
		else:
			sum_so_far = max(sum_so_far, current_sum)
	return sum_so_far

def mex(li):
	check = [0] * 1001
	for i in li:
		check[i] += 1
	for i in range(len(check)):
		if check[i] == 0:
			return i

def sumdigits(n):
	ans = 0
	while n != 0:
		ans += n % 10
		n //= 10
	return ans

def product(li):
	ans = 1
	for i in li:
		ans *= i
	return ans

def maxpower(n, k):
	cnt = 0
	while n > 1:
		cnt += 1
		n //= k
	return cnt

def knapsack(li, sumi, s, n, dp):
	if s == sumi // 2:
		return 1
	elif n == 0:
		return 0
	elif dp[n][s] != -1:
		return dp[n][s]
	else:
		if li[n - 1] <= s:
			dp[n][s] = knapsack(li, sumi, s - li[n - 1], n - 1, dp) or knapsack(li, sumi, s, n - 1, dp)
		else:
			dp[n][s] = knapsack(li, sumi, s, n - 1, dp)
		return dp[n][s]

def pref(li):
	pref_sum = [0]
	for i in li:
		pref_sum.append(pref_sum[-1] + i)
	return pref_sum
from math import *
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	f = 0
	ans = lower_bound(a, a[0] + a[1])
	if a[ans] < a[0] + a[1]:
		print(-1)
	else:
		print(1, 2, ans + 1)


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	line = input().split(' ')
	numbers = []
	for i in line:
		numbers.append(int(i))
	found = False
	aa = -1
	bb = -1
	cc = -1
	i = 0
	j = 1
	k = n - 1
	a = numbers[i]
	b = numbers[j]
	c = numbers[k]
	if a + b > c and a + c > b and (b + c > a):
		found = True
	else:
		found = False
		aa = i + 1
		bb = j + 1
		cc = k + 1
	if found:
		print('-1')
	else:
		print('{} {} {}'.format(aa, bb, cc))


t = int(input())
while t:
	t -= 1
	n = int(input())
	lst = list(map(int, input().split()))
	res = -1
	a = lst[0]
	b = lst[1]
	if n == 3:
		if a + b <= lst[2]:
			res = 3
	else:
		for i in range(2, n):
			if a + b <= lst[i]:
				res = i + 1
				break
	if res == -1:
		print(-1)
	else:
		print(1, 2, res)


for j in range(int(input())):
	a = int(input())
	li = list(map(int, input().split()))
	ma = li[a - 1]
	mi = li[0]
	val = ma - mi
	for j in range(1, a):
		if li[j] <= val:
			mid = j
			print(1, j + 1, a)
			break
	else:
		print(-1)


t = int(input())
for tt in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	ok = True
	res = (0, 0, 0)
	i = 0
	while i + 1 < n - 1 - i:
		if a[i] + a[i + 1] <= a[n - 1 - i]:
			ok = False
			res = (i + 1, i + 2, n - 1 - i + 1)
		if i < n - 2 - i:
			if a[n - 1 - i] >= a[i] + a[n - 2 - i]:
				ok = False
				res = (i + 1, n - 2 - i + 1, n - 1 - i + 1)
		i += 1
	if ok:
		print(-1)
	else:
		print(res[0], res[1], res[2])


import math
import sys

def dict_sort(ans):
	ans = sorted(ans.items(), reverse=True, key=lambda kv: kv[1])

def is_prime(n):
	if n == 1:
		return 0
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // gcd(a, b)

def alphbates():
	return 'abcdefghijklmnopqrstuvwxyz'

def binary_search(ls, n, flag):
	low = 0
	hi = n - 1
	while low <= hi:
		mid = (low + hi) // 2
		if ls[mid] == flag:
			return mid
		elif ls[mid] > flag:
			hi = mid - 1
		else:
			low = mid + 1
	return -1

def inp():
	ls = list(map(int, input().split()))
	return ls

def mult_inp():
	return map(int, input().split())
t = int(input())
for _i in range(t):
	n = int(input())
	ls = inp()
	flag = ls[0] + ls[1]
	chk = 0
	for i in range(2, n):
		if flag <= ls[i]:
			print('1 2', i + 1)
			chk = 1
			break
	if chk == 0:
		print(-1)


for x in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()][:n]
	c = a[0] + a[1]
	d = 0
	for x in range(2, n):
		if c <= a[x] and n >= 3:
			print('1 2', x + 1)
			d = 1
			break
	if d == 0:
		print('-1')


for t in range(int(input())):
	b = int(input())
	a = [int(x) for x in input().split()]
	flag = 0
	if a[0] + a[1] <= a[-1]:
		print(1, 2, b)
	else:
		print('-1')


rw = int(input())
for qwe in range(rw):
	n = int(input())
	a = list(map(int, input().split()))
	a.reverse()
	if a[0] >= a[n - 2] + a[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


T = int(input())
for t in range(T):
	n = int(input())
	A = [int(i) for i in input().split()]
	if A[0] + A[1] > A[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(lambda x: int(x), input().split()))
	minimum = a[0]
	minimum_index = 0
	for i in range(1, len(a)):
		if a[i] < minimum:
			minimum = a[i]
			minimum_index = i
	second_minimum = a[0] if 0 != minimum_index else a[1]
	second_minimum_index = 0 if 0 != minimum_index else 1
	for i in range(0, len(a)):
		if a[i] < second_minimum and i != minimum_index:
			second_minimum = a[i]
			second_minimum_index = i
	maximum = a[0]
	maximum_index = 0
	for i in range(0, len(a)):
		if a[i] > maximum:
			maximum = a[i]
			maximum_index = i
	if minimum + second_minimum <= maximum:
		a = [maximum_index, second_minimum_index, minimum_index]
		a.sort()
		print(a[0] + 1, a[1] + 1, a[2] + 1)
	else:
		print(-1)


import sys
from collections import Counter
from math import ceil, gcd, log
from bisect import bisect, bisect_left, bisect_right
input = sys.stdin.readline

def check(a, b, c):
	if a + b <= c or a + c <= b or b + c <= a:
		return False
	else:
		return True

def solve(n, arr):
	a = arr[0]
	b = arr[1]
	p = arr.index(a)
	q = arr.index(b)
	flag = False
	arr = arr[2:]
	for (j, i) in enumerate(arr):
		c = i
		if not check(a, b, c):
			ans = (a, b, j)
			flag = True
			break
		else:
			continue
	if flag:
		if p == q:
			q += 1
		print(p + 1, q + 1, 3 + ans[-1])
	else:
		print(-1)
	return

def main():
	for _ in range(int(input())):
		n = int(input())
		arr = list(map(int, input().split()))
		solve(n, arr)
	return
main()


def degenerate(a, n):
	a = sorted(a)
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	degenerate(a, n)


for y in range(int(input())):
	n = int(input())
	lst = list(map(int, input().split()))
	a = 0
	b = 1
	c = n
	if lst[a] + lst[b] > lst[n - 1]:
		print('-1')
	else:
		print('1', '2', str(n))


def check(arrayList):
	result = '-1'
	if arrayList[0] + arrayList[1] <= arrayList[len(arrayList) - 1]:
		last_index = str(len(arrayList))
		result = '1 2 '
		result = result + last_index
	print(result)
t = int(input())
for i in range(0, t):
	n = int(input())
	lists = list((int(num) for num in input().strip().split()))[:n]
	check(lists)


for _ in range(int(input())):
	N = int(input())
	A = list(map(int, input().split()))
	t = A[0] + A[1]
	temp = 0
	for i in range(2, N):
		if A[i] >= t:
			temp = 1
			print(1, 2, i + 1)
			break
	if temp == 0:
		print(-1)


from sys import stdin
m = int(stdin.readline().strip())
for i in range(m):
	n = int(stdin.readline().strip())
	s = list(map(int, stdin.readline().strip().split()))
	arr = [s[0], s[1], s[-1]]
	if arr[-1] >= arr[0] + arr[1]:
		print(1, 2, n)
	else:
		print(-1)


import sys
import os.path
if os.path.exists('in.txt'):
	sys.stdin = open('in.txt', 'r')
	sys.stdout = open('out.txt', 'w')
for _ in range(int(input())):
	n = int(input())
	li = list(map(int, input().split()))
	l = sorted(li)
	if l[0] + l[1] > l[-1]:
		print(-1)
	else:
		print(1, 2, n)


def solve():
	n = int(input())
	A = list(map(int, input().split()))
	if A[0] + A[1] <= A[-1]:
		return ' '.join(map(str, [1, 2, n]))
	else:
		return -1

def main():
	t = int(input())
	ANS = [solve() for _ in range(t)]
	print('\n'.join(map(str, ANS)))
main()


for z in range(int(input())):
	n = int(input())
	flag = True
	a = [int(i) for i in input().split()]
	for i in range(n - 2):
		if a[i] + a[i + 1] <= a[n - 1]:
			flag = False
			print(i + 1, i + 2, n)
			break
	if flag == True:
		print('-1')


for _ in range(0, int(input())):
	a = int(input())
	b = list(map(int, input().split()))
	b.sort()
	if b[0] + b[1] > b[a - 1] and b[1] - b[0] < b[a - 1] and (b[a - 1] - b[1] < b[0]) and (b[a - 1] - b[0] < b[1]):
		print('-1')
	else:
		print(1, 2, a)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())

def print_list(l):
	print(' '.join(map(str, l)))
from collections import defaultdict as dc
for _ in range(N()):
	n = N()
	a = RLL()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for it in range(t):
	n = int(input())
	a = [int(tmp) for tmp in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


def solve(a):
	if a[0] + a[1] <= a[-1]:
		return (1, 2, len(a))
	return [-1]
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	print(*solve(a))


t = int(input())
for i in range(t):
	n = int(input())
	s = input()
	l = s.split()
	lst = []
	for i in range(len(l)):
		lst.append(int(l[i]))
	if lst[0] + lst[1] <= lst[n - 1]:
		print('1 2', n)
	else:
		print('-1')


def fun(arr, N):
	l = [1, 2, N]
	if arr[0] + arr[1] > arr[N - 1]:
		l1 = [-1]
		return l1
	else:
		return l
out = []
test = int(input())
for x in range(test):
	N = int(input())
	arr = list(map(int, input().split()))
	out.append(fun(arr, N))
for x in range(len(out)):
	for k in range(len(out[x])):
		print(out[x][k], end=' ')
	if x < len(out) - 1:
		print()


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def L():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
try:
	sys.stdin = open('input.txt', 'r')
except:
	pass
for _ in range(L()[0]):
	n = L()[0]
	A = L()
	x = A[0]
	y = A[1]
	z = A[-1]
	if x + y <= z:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	L = [int(x) for x in input().split()]
	if L[0] + L[1] <= L[-1]:
		print('1 2 ' + str(n))
	else:
		print(-1)


import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque

def r():
	return int(input())

def rm():
	return map(int, input().split())

def rl():
	return list(map(int, input().split()))
for _ in range(r()):
	n = r()
	a = rl()
	ans = False
	sumi = a[0] + a[1]
	for i in range(2, n):
		if a[i] >= sumi:
			print(1, 2, i + 1)
			ans = True
			break
	if ans == False:
		print(-1)


for i in range(int(input())):
	n = int(input())
	l = [int(x) for x in input().split()]
	count = 0
	if l[0] + l[1] <= l[n - 1]:
		print(*[1, 2, n])
	else:
		print(-1)


from sys import stdin
g = lambda : stdin.readline().strip()
gl = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
mod = int(1000000000.0) + 7
inf = float('inf')
(t,) = gil()
from bisect import *
for _ in range(t):
	(n,) = gil()
	a = gil()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


import math, sys
from sys import stdin, stdout
from collections import Counter, defaultdict, deque
input = stdin.readline
I = lambda : int(input())
li = lambda : list(map(int, input().split()))

def solve():
	n = I()
	a = li()
	(p, q, r) = (a[0], a[1], a[-1])
	if p + q <= r:
		print(1, 2, n)
	else:
		print(-1)
for _ in range(I()):
	solve()


import sys, math
from collections import deque, defaultdict
import operator as op
from functools import reduce
sys.setrecursionlimit(10 ** 6)
I = sys.stdin.readline

def ii():
	return int(I().strip())

def li():
	return list(map(int, I().strip().split()))

def mi():
	return map(int, I().strip().split())

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def main():
	for _ in range(ii()):
		n = ii()
		arr = li()
		if arr[0] + arr[1] <= arr[-1]:
			print(1, 2, n)
		else:
			print(-1)
main()


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	i = 0
	j = 1
	k = n - 1
	t = 0
	while j != k:
		if arr[i] + arr[j] <= arr[k]:
			print(i + 1, j + 1, k + 1)
			t = -1
			break
		k -= 1
	if t == 0:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	lst = list(map(int, input().split()))
	if lst[0] + lst[1] <= max(lst):
		print(1, 2, lst.index(max(lst)) + 1)
	else:
		print(-1)


import sys
t = int(input())
for _ in range(t):
	n = int(input())
	li = list(map(int, input().split()))[:n]
	if li[0] + li[1] > li[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
while t:
	t -= 1
	n = int(input())
	arr = list(map(int, input().split()))
	i = 0
	if arr[i] + arr[i + 1] <= arr[n - 1]:
		print(i + 1, i + 2, n)
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	p = max(l)
	i1 = l.index(p)
	m1 = min(l)
	i2 = l.index(m1)
	l[i2] = p
	m2 = min(l)
	i3 = l.index(m2)
	if m1 + m2 <= p:
		i1 += 1
		i2 += 1
		i3 += 1
		l1 = []
		l1.append(i1)
		l1.append(i2)
		l1.append(i3)
		l1.sort()
		print(*l1, sep=' ')
	else:
		print(-1)


t = int(input())
while t > 0:
	n = int(input())
	l = [int(x) for x in input().split()]
	s = l[0] + l[1]
	if s <= l[-1]:
		print(f'1 2 {n}')
	else:
		print('-1')
	t -= 1


import sys
input = sys.stdin.buffer.readline

def solution():
	n = int(input())
	l = list(map(int, input().split()))
	i = 0
	k = n - 1
	j = 1
	if l[i] + l[j] <= l[k]:
		print(i + 1, j + 1, k + 1)
	else:
		print(-1)
t = int(input())
for _ in range(t):
	solution()


numOfCases = int(input())
numOfElements = 0
for i in range(numOfCases):
	numOfElements = int(input())
	lengthInputs = input()
	lengthInputs = lengthInputs.split(' ')
	lengthInputs = [int(x) for x in lengthInputs]
	if lengthInputs[-1] >= lengthInputs[0] + lengthInputs[1]:
		print('1 2', str(numOfElements))
	else:
		print('-1')


numCases = int(input())
cases = []
values = []
for i in range(numCases):
	cases.append(input())
	values.append(list(map(int, input().split(' '))))
ret = []
for x in values:
	if x[0] + x[1] > x[-1]:
		ret.append('-1')
	else:
		ret.append([1, 2, x.index(x[-1]) + 1])
for i in ret:
	k = []
	if i != '-1':
		for x in i:
			k.append(str(x))
		print(' '.join(k))
	else:
		print(-1)


from sys import stdin

def iinput():
	return int(stdin.readline())

def minput():
	return map(int, stdin.readline().split())

def linput():
	return list(map(int, stdin.readline().split()))
t = iinput()
while t:
	t -= 1
	n = iinput()
	a = linput()
	for i in range(2, n):
		if a[i] >= a[0] + a[1]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


import sys
input = sys.stdin.readline
(inp, ip) = (lambda : int(input()), lambda : [int(w) for w in input().split()])
for _ in range(inp()):
	n = inp()
	x = ip()
	if x[0] + x[1] <= x[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	(*arr,) = map(int, input().split())
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, len(arr))
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	c = 0
	if l[0] + l[1] <= max(l):
		a = l.index(max(l))
		print(1, 2, a + 1)
	else:
		print(-1)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	L = list(map(int, input().split()))
	flag = 0
	for i in range(n - 2):
		if L[i] + L[i + 1] <= L[-1]:
			print(i + 1, i + 2, n)
			break
	else:
		print(-1)


import math
from collections import Counter, defaultdict
I = lambda : int(input())
M = lambda : map(int, input().split())
LI = lambda : list(map(int, input().split()))
for _ in range(I()):
	n = I()
	a = LI()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	(n, arr) = (int(input()), list(map(int, input().split())))
	(a, b) = (arr[0], arr[1])
	s = a + b
	f = 1
	for i in range(2, n):
		if s <= arr[i]:
			f = 0
			print(1, 2, i + 1)
			break
	if f:
		print(-1)


T = int(input())
for z in range(T):
	N = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[len(a) - 1]:
		print(1, ' ', 2, ' ', len(a))
	else:
		print(-1)


from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math

def get_int():
	return int(stdin.readline().strip())

def get_tuple():
	return map(int, stdin.readline().split())

def get_list():
	return list(map(int, stdin.readline().split()))

def solve():
	n = get_int()
	ls = get_list()
	if ls[0] + ls[1] <= ls[-1]:
		print(1, 2, n)
	else:
		print('-1')

def main():
	solve()
TestCases = True
if TestCases:
	for i in range(get_int()):
		main()
else:
	main()


n = int(input())
for i in range(n):
	m = int(input())
	a = [int(i) for i in input().split()]
	a = sorted(a)
	if a[0] + a[1] > a[len(a) - 1] and a[len(a) - 1] - a[1] < a[0]:
		print(-1)
	else:
		print(1, 2, len(a))


import sys, math
input = sys.stdin.readline
t = int(input())
for r in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	a = l[0]
	b = l[1]
	c = l[n - 1]
	if a + b > c and b + c > a and (a + c > b):
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	i = 0
	k = n - 1
	for m in range(1, n - 1):
		if a[i] + a[m] <= a[k]:
			print(i + 1, m + 1, k + 1)
			break
	else:
		print(-1)


import sys
n = int(sys.stdin.readline())
for _ in range(n):
	m = int(sys.stdin.readline())
	arr = list(map(int, sys.stdin.readline().split()))
	if arr[0] + arr[1] <= arr[-1]:
		print(f'1 2 {len(arr)}')
	else:
		print('-1')


import sys
import math
from math import *
from collections import Counter, defaultdict
from io import BytesIO, IOBase
from collections import deque
import bisect

def main():
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, n)
for i in range(int(input())):
	main()


rounds = int(input())
for _ in range(rounds):
	n = int(input())
	values = list(map(int, input().split()))
	if values[0] + values[1] <= values[-1]:
		print(1, 2, len(values))
	else:
		print(-1)


inp = lambda cast=int: [cast(x) for x in input().split()]
printf = lambda s='', *args, **kwargs: print(str(s).format(*args), flush=True, **kwargs)
(t,) = inp()
for _ in range(t):
	(n,) = inp()
	A = inp()
	(a, b, c) = (A[0], A[1], A[-1])
	if a + b <= c:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	s = list(map(int, input().split()))
	c = 0
	for i in range(n - 2):
		j = i + 1
		for k in range(j + 1, n):
			if s[i] + s[j] > s[-1]:
				c = -1
				break
			elif s[i] + s[j] <= s[k]:
				c = 1
				break
		if c == 1 or c == -1:
			break
	if c == 1:
		print(i + 1, j + 1, k + 1)
	elif c == -1:
		print(-1)


import sys, bisect, string, math, time, functools, random, fractions
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
from itertools import permutations, combinations, groupby
rep = range
R = range

def Golf():
	(n, *t) = map(int, open(0).read().split())

def I():
	return int(input())

def S_():
	return input()

def IS():
	return input().split()

def LS():
	return [i for i in input().split()]

def MI():
	return map(int, input().split())

def LI():
	return [int(i) for i in input().split()]

def LI_():
	return [int(i) - 1 for i in input().split()]

def NI(n):
	return [int(input()) for i in range(n)]

def NI_(n):
	return [int(input()) - 1 for i in range(n)]

def StoLI():
	return [ord(i) - 97 for i in input()]

def ItoS(n):
	return chr(n + 97)

def LtoS(ls):
	return ''.join([chr(i + 97) for i in ls])

def RA():
	return map(int, open(0).read().split())

def RLI(n=8, a=1, b=10):
	return [random.randint(a, b) for i in range(n)]

def RI(a=1, b=10):
	return random.randint(a, b)

def Rtest(T):
	(case, err) = (0, 0)
	for i in range(T):
		inp = INP()
		(a1, ls) = naive(*inp)
		a2 = solve(*inp)
		if a1 != a2:
			print((a1, a2), inp)
			err += 1
		case += 1
	print('Tested', case, 'case with', err, 'errors')

def GI(V, E, ls=None, Directed=False, index=1):
	org_inp = []
	g = [[] for i in range(V)]
	FromStdin = True if ls == None else False
	for i in range(E):
		if FromStdin:
			inp = LI()
			org_inp.append(inp)
		else:
			inp = ls[i]
		if len(inp) == 2:
			(a, b) = inp
			c = 1
		else:
			(a, b, c) = inp
		if index == 1:
			a -= 1
			b -= 1
		aa = (a, c)
		bb = (b, c)
		g[a].append(bb)
		if not Directed:
			g[b].append(aa)
	return (g, org_inp)

def GGI(h, w, search=None, replacement_of_found='.', mp_def={'#': 1, '.': 0}, boundary=1):
	mp = [boundary] * (w + 2)
	found = {}
	for i in R(h):
		s = input()
		for char in search:
			if char in s:
				found[char] = (i + 1) * (w + 2) + s.index(char) + 1
				mp_def[char] = mp_def[replacement_of_found]
		mp += [boundary] + [mp_def[j] for j in s] + [boundary]
	mp += [boundary] * (w + 2)
	return (h + 2, w + 2, mp, found)

def TI(n):
	return GI(n, n - 1)

def accum(ls):
	rt = [0]
	for i in ls:
		rt += [rt[-1] + i]
	return rt

def bit_combination(n, base=2):
	rt = []
	for tb in R(base ** n):
		s = [tb // base ** bt % base for bt in R(n)]
		rt += [s]
	return rt

def gcd(x, y):
	if y == 0:
		return x
	if x % y == 0:
		return y
	while x % y != 0:
		(x, y) = (y, x % y)
	return y

def YN(x):
	print(['NO', 'YES'][x])

def Yn(x):
	print(['No', 'Yes'][x])

def show(*inp, end='\n'):
	if show_flg:
		print(*inp, end=end)
mo = 10 ** 9 + 7
inf = float('inf')
FourNb = [(-1, 0), (1, 0), (0, 1), (0, -1)]
EightNb = [(-1, 0), (1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (1, -1), (-1, 1)]
compas = dict(zip('WENS', FourNb))
cursol = dict(zip('LRUD', FourNb))
l_alp = string.ascii_lowercase
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
input = lambda : sys.stdin.readline().rstrip()
show_flg = False
show_flg = True
ans = 0
for _ in range(I()):
	n = I()
	a = LI()
	if a[0] + a[1] > a[-1]:
		ans = [-1]
	else:
		ans = [1, 2, n]
	print(*ans)


for test in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	b = a[0]
	c = a[1]
	d = a[-1]
	if c + b > d:
		print(-1)
	else:
		print(1, 2, n)


import math
for i in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	if ar[0] + ar[1] <= ar[-1]:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	A = list(map(int, input().split()))
	if not A[n - 1] >= A[0] + A[1]:
		print(-1)
	else:
		print(1, 2, n)


import sys, os, io

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math, datetime, functools, itertools, operator, bisect, fractions
from collections import deque, defaultdict, OrderedDict
from fractions import Fraction
from decimal import Decimal

def yetohanswerhai(k, a, b):
	c = True
	for i in a:
		t = 0
		for j in b:
			if i & j | k == k:
				t += 1
				break
		if t == 0:
			c = False
			break
	return c

def main():
	starttime = datetime.datetime.now()
	if os.path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	for _ in range(ri()):
		n = ri()
		arr = ria()
		a = arr[0]
		b = arr[1]
		c = arr[n - 1]
		if a + b <= c:
			print(1, 2, n)
		else:
			print(-1)
	endtime = datetime.datetime.now()
	time = (endtime - starttime).total_seconds() * 1000
	if os.path.exists('input.txt'):
		print('Time:', time, 'ms')

class FastReader(io.IOBase):
	newlines = 0

	def __init__(self, fd, chunk_size=1024 * 8):
		self._fd = fd
		self._chunk_size = chunk_size
		self.buffer = io.BytesIO()

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self, size=-1):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

class FastWriter(io.IOBase):

	def __init__(self, fd):
		self._fd = fd
		self.buffer = io.BytesIO()
		self.write = self.buffer.write

	def flush(self):
		os.write(self._fd, self.buffer.getvalue())
		(self.buffer.truncate(0), self.buffer.seek(0))

class FastStdin(io.IOBase):

	def __init__(self, fd=0):
		self.buffer = FastReader(fd)
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

class FastStdout(io.IOBase):

	def __init__(self, fd=1):
		self.buffer = FastWriter(fd)
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.flush = self.buffer.flush
sys.stdin = FastStdin()
sys.stdout = FastStdout()
main()


t = int(input(''))
arr = []
for i in range(t):
	int(input(''))
	arr.append(list(map(int, input().split())))
for i in arr:
	n = len(i)
	s = i[0] + i[1]
	flag = 0
	for j in range(2, n):
		if i[j] >= s:
			print(1, 2, j + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


import sys
t = int(sys.stdin.readline())
for _ in range(t):
	n = int(sys.stdin.readline())
	m = {}
	A = list(map(int, sys.stdin.readline().split()))
	i = 0
	j = n - 2
	k = n - 1
	f = False
	while i < j:
		if A[i] + A[j] <= A[k]:
			f = True
			break
		else:
			j -= 1
	if f:
		print(i + 1, j + 1, k + 1)
	else:
		print(-1)


import sys
I = lambda : int(input())
RL = readline = lambda : sys.stdin.readline().strip('\n')
RM = readmap = lambda x=int: map(x, readline().split(' '))
for _ in range(I()):
	(n, l) = (I(), [*RM()])
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	pole = input().split()
	for j in range(n):
		pole[j] = int(pole[j])
	hran = pole[0] + pole[1]
	pravda = False
	for j in range(n):
		if pole[j] >= hran:
			pravda = True
			break
	if pravda == True:
		print(1, 2, j + 1)
	else:
		print(-1)


t = int(input())
for i in range(0, t):
	input()
	A = list(map(lambda x: int(x), input().split()))
	A.sort()
	if A[0] + A[1] <= A[-1]:
		print(1, 2, len(A))
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	nums = list(map(int, input().split()))
	flag = 0
	for i in range(len(nums) - 2):
		x = nums[i] + nums[i + 1]
		if nums[-1] >= x:
			print(i + 1, i + 2, len(nums))
			flag = 1
			break
	if flag == 0:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	m = max(l)
	for i in range(0, n - 1):
		if l[i] + l[i + 1] <= m:
			print(i + 1, i + 2, n)
			break
	else:
		print(-1)


import collections as cc
I = lambda : list(map(int, input().split()))
for tc in range(int(input())):
	(n,) = I()
	l = sorted(I())
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
	else:
		print(-1)


T = int(input())
for I in range(0, T):
	N = int(input())
	X = sorted(list(map(int, input().split(' '))))
	if X[0] + X[1] <= X[-1]:
		print(1, 2, len(X))
	else:
		print(-1)


def func():
	t = int(input())
	for _ in range(t):
		n = int(input())
		lst = list(map(int, input().strip().split()))
		if lst[0] + lst[1] > lst[-1]:
			print(-1)
		else:
			print(1, 2, len(lst))
func()


import sys
input = sys.stdin.readline
from bisect import bisect_left
from bisect import bisect_right
from math import ceil, factorial

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def nCr(n, k):
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i

def factoriazation(x):
	ret = {}
	while x != 1:
		ret[spf[x]] = ret.get(spf[x], 0) + 1
		x = x // spf[x]
	return ret

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
for _ in range(int(input())):
	n = int(input())
	a = int_array()
	if a[0] + a[1] <= a[-1]:
		print(*[1, 2, n])
	else:
		print(-1)


import sys

def main():
	res = ''
	input = sys.stdin.readline
	print = sys.stdout.write
	t = int(input())
	for _ in range(t):
		n = int(input())
		a = list(map(int, input().split()))
		if a[0] + a[1] <= a[n - 1]:
			sub_res = f'{1} {2} {n}\n'
		else:
			sub_res = '-1\n'
		res += sub_res
	print(res)
main()


T = int(input())
for _ in range(T):
	N = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, N)
	else:
		print(-1)


for z in range(int(input())):
	n = int(input())
	flag = 1
	a = [int(i) for i in input().split()]
	for i in range(n - 2):
		if a[i] + a[i + 1] <= a[n - 1]:
			flag = 0
			print(i + 1, i + 2, n)
			break
	if flag == 1:
		print('-1')


n = int(input())
for _ in range(n):
	leng = int(input())
	array = input().strip().split(' ')
	x = int(array[0])
	y = int(array[1])
	z = int(array[-1])
	if x + y <= z:
		print('%d %d %d' % (1, 2, leng))
	else:
		print('-1')


t = int(input())
for _ in range(t):
	n = int(input())
	l = list([int(x) for x in input().split()])
	a = l[0]
	b = l[1]
	c = l[n - 1]
	if a + b <= c:
		print(1, 2, n)
	else:
		print('-1')


for _ in range(int(input())):
	n = int(input())
	arr = [int(c) for c in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	x = a[0]
	y = a[1]
	res = 0
	for i in range(n - 1, 1, -1):
		if x + y <= a[i]:
			res = i + 1
			break
	if res == 0:
		print(-1)
	else:
		print('1 2', res)


for i in range(int(input())):
	f = 0
	n = int(input())
	s = list(map(int, input().split()))
	if s[0] + s[1] > s[len(s) - 1]:
		print('-1')
	else:
		print('1', end=' ')
		print('2', end=' ')
		print(n)


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	print(*[[1, 2, n], [-1]][arr[0] + arr[1] > arr[n - 1]])


n = input()
for i in range(int(n)):
	a = int(input())
	li = []
	li = input().split()
	if int(li[0]) + int(li[1]) <= int(li[a - 1]):
		print(str(1) + ' ' + str(2) + ' ' + str(a))
	else:
		print('-1')


from decimal import *
getcontext().prec = 16
from math import sqrt
t = int(input())
answer = []
for test in range(t):
	n = int(input())
	liste = list(map(int, input().split(' ')))
	(a, b) = (liste[0], liste[1])
	for k in range(2, n):
		if liste[k] >= a + b:
			answer.append('1 2 ' + str(k + 1))
			break
	else:
		answer.append('-1')
print('\n'.join(answer))


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	s = set(a)
	flag = False
	for i in range(1, n - 1):
		if a[i - 1] + a[i] > a[n - 1]:
			pass
		else:
			print(f'{i} {i + 1} {n}')
			flag = True
			break
	if flag == False:
		print(-1)


def solve():
	n = int(input())
	a = list(map(int, input().split()))
	(i, j) = (0, 1)
	tmp = a[0] + a[1]
	for k in range(2, n):
		if a[k] >= tmp:
			print(i + 1, j + 1, k + 1)
			return
	print(-1)
for _ in range(int(input())):
	solve()


tests = int(input())
for t in range(tests):
	n = int(input())
	ls = list(map(int, input().split()))
	if ls[0] + ls[1] <= ls[-1]:
		print(f'1 2 {n}')
	else:
		print(-1)


t = int(input())
inn = []
result = []
c = 0
for j in range(t):
	n = int(input())
	inn = [int(a) for a in input().split()]
	if (inn[0] + inn[1] > inn[n - 1]) & (inn[0] + inn[n - 1] > inn[1]) & (inn[1] + inn[n - 1] > inn[0]) & ((inn[n - 1] + inn[n - 2] > inn[0]) & (inn[n - 1] + inn[0] > inn[n - 2]) & (inn[0] + inn[n - 2] > inn[n - 1])):
		result.append('-1')
	else:
		result.append([1, 2, n])
for i in result:
	if type(i) == list:
		for j in i:
			if c != len(i) - 1:
				print(j, end=' ')
				c = c + 1
			else:
				print(j)
				c = 0
	else:
		print(i)


from sys import stdin, stdout
import bisect
import math
from collections import deque
mod = 10 ** 9 + 7

def st():
	return list(stdin.readline().strip())

def inp():
	return int(stdin.readline())

def li():
	return list(map(int, stdin.readline().split()))

def mp():
	return map(int, stdin.readline().split())

def pr(n):
	stdout.write(str(n) + '\n')

def DFS(dictionary, vertex, visited):
	visited[vertex] = True
	stack = [vertex]
	print(vertex)
	while stack:
		a = stack.pop()
		for i in dictionary[a]:
			if not visited[i]:
				print(i)
				visited[i] = True
				stack.append(i)

def BFS(dictionary, vertex, visited):
	visited[vertex] = True
	q = deque()
	q.append(vertex)
	while q:
		a = q.popleft()
		for i in dictionary[a]:
			if not visited[i]:
				visited[i] = True
				q.append(i)
				print(i)

def soe(limit):
	l = [1] * (limit + 1)
	l[0] = 0
	l[1] = 0
	prime = []
	for i in range(2, limit + 1):
		if l[i]:
			for j in range(i * i, limit + 1, i):
				l[j] = 0
	for i in range(2, limit + 1):
		if l[i]:
			prime.append(i)
	return prime

def segsoe(low, high):
	limit = int(high ** 0.5) + 1
	prime = soe(limit)
	n = high - low + 1
	l = [0] * (n + 1)
	for i in range(len(prime)):
		lowlimit = low // prime[i] * prime[i]
		if lowlimit < low:
			lowlimit += prime[i]
		if lowlimit == prime[i]:
			lowlimit += prime[i]
		for j in range(lowlimit, high + 1, prime[i]):
			l[j - low] = 1
	for i in range(low, high + 1):
		if not l[i - low]:
			if i != 1:
				print(i)

def gcd(a, b):
	while b:
		a = a % b
		(b, a) = (a, b)
	return a

def power(a, n):
	r = 1
	while n:
		if n & 1:
			r = r * a
		a *= a
		n = n >> 1
	return r

def solve():
	n = inp()
	l = li()
	for i in range(2, n):
		if l[0] + l[1] <= l[i]:
			print(1, 2, i + 1)
			return
	print(-1)
for _ in range(inp()):
	solve()


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	m = n - 1
	l = 1
	if a[m] >= a[l - 1] + a[l]:
		print(l, l + 1, m + 1)
	else:
		print(-1)


from bisect import bisect_left
for _ in range(int(input())):
	N = int(input())
	X = list(map(int, input().split()))
	Index = bisect_left(X, X[0] + X[1])
	print(-1 if Index == N else '1 2 ' + str(Index + 1))


def get_triplet(arr):
	return [1, 2, len(arr)] if arr[0] + arr[1] <= arr[-1] else None
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	result = get_triplet(arr)
	if not result:
		print(-1)
	else:
		print(' '.join(map(str, result)))


from math import *
from copy import *
from string import *
from random import *
from sys import stdin, stdout
from sys import maxsize
from operator import *
from itertools import *
from collections import Counter
import math
import math
import time
from queue import Queue

def seive(n):
	l = [True]
	l = l * (n + 1)
	for i in range(2, int(sqrt(n)) + 1):
		if l[i] == True:
			val = i * i
			while val < len(l):
				l[val] = False
				val += i
	prime = []
	for i in range(2, len(l)):
		if l[i] == True:
			prime.append(i)
	return prime

def dp(l, i, n, val, ans):
	if i >= n or val < 0:
		return 1000000
	elif val == 0:
		return 0
	else:
		if ans[i] == 1000000:
			ans[i] = min(min(1 + dp(l, i + 1, n, val - l[i], ans), 1 + dp(l, i, n, val - l[i], ans)), dp(l, i + 1, n, val, ans))
		return ans[i]
from queue import Queue

def factors(n):
	l = []
	for i in range(1, int(sqrt(n)) + 1):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def check1(s, v, x):
	while True:
		if v not in s:
			return v
		else:
			v -= 1

def check2(s, v, x):
	while True:
		if v not in s:
			return v
		else:
			v += 1

def up(n):
	j = n - 1
	while j > 0:
		if n % j == 0:
			break
		j -= 1
	return j

def fac(n):
	c = 1
	i = 1
	while i <= n:
		c *= i
		i += 1
	return c

def check_happy(n):
	ss = set()
	print(n)
	while n != 1:
		val = n
		s = 0
		print(val)
		while val != 0:
			s += (val % 10) ** 2
			val = val // 10
		print(val)
		print('hi')
		if val in ss:
			return False
		else:
			n = val
			ss.add(n)
	return True

def update(a, b):
	c = 1
	val = a
	while a < b:
		print(c, a)
		c += c
		a += a
	print(1)
	while a > b:
		print()
		a -= val
		c -= 1
	return c
import random as rand

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)
from itertools import permutations

def insertion_sort(arr):
	for i in range(len(arr)):
		j = i
		while j > 0:
			if arr[j] < arr[j - 1]:
				temp = arr[j]
				arr[j] = arr[j - 1]
				arr[j - 1] = temp
			j -= 1
	return arr

def quick_sort(arr, low, high):
	i = low
	j = high
	while i < j:
		if arr[i] > arr[low] and arr[j] < arr[low]:
			temp = arr[i]
			arr[i] = arr[j]
			arr[j] = arr[i]
			i += 1
			j -= 1
		elif arr[i] <= arr[low]:
			i += 1
		elif arr[j] >= arr[low]:
			j -= 1
	print(i, j)
	toto = arr[j]
	arr[j] = arr[low]
	arr[low] = toto
	return j

def dodo(arr, low, high):
	if low < high:
		val = quick_sort(arr, low, high)
		dodo(arr, low, val - 1)
		dodo(arr, val + 1, high)

def dp(arr, c, n, k, z, ans):
	if k == 0:
		return ans
	elif c == 0:
		return dp(arr, c + 1, n, k - 1, z, ans + arr[c + 1])
	elif c == n - 1:
		if z == 0:
			return 0
		else:
			return dp(arr, c - 1, n, k - 1, z - 1, ans + arr[c - 1])
	elif z == 0:
		return dp(arr, c + 1, n, k - 1, z, ans + arr[c + 1])
	else:
		return max(dp(arr, c + 1, n, k - 1, z, ans + arr[c + 1]), dp(arr, c - 1, n, k - 1, z - 1, ans + arr[c - 1]))

def check(arr, val):
	a = -1
	for i in range(len(arr)):
		if arr[i][len(arr[i]) - 1] == val:
			a = i
			break
	return a

def reverse(s, i, ans):
	if i >= len(s):
		return ans
	else:
		return reverse(s, i + 1, s[i] + ans)

def update(arr, i, j, n, m):
	if i >= 0 and i < n and (j >= 0) and (j < m):
		if arr[i][j] == 1:
			arr[i][j] == 2
			return [i, j]
	return [-1, -1]
t = int(stdin.readline())
for i in range(t):
	n = int(stdin.readline())
	arr = list(map(int, stdin.readline().split(' ')))
	if arr[0] + arr[1] <= arr[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


def solution(arr):
	(a, b, c) = (arr[0], arr[1], arr[-1])
	if a + b > c:
		return -1
	return 1
for _ in range(int(input())):
	n = int(input())
	arr = [int(x) for x in input().split()]
	ans = solution(arr)
	if ans == -1:
		print(-1)
	else:
		print(ans, ans + 1, len(arr))


test_cases = int(input())
for test_case in range(test_cases):
	n = int(input())
	a = list(map(int, input().split()))
	sum = 0
	c = 0
	for i in range(n - 2):
		sum = a[i] + a[i + 1]
		if a[-1] >= sum:
			c = 1
			break
		sum = 0
	if c == 0:
		print('-1')
	else:
		print(i + 1, i + 2, n)


MOD = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
from collections import Counter
for _ in range(ii()):
	n = ii()
	a = il()
	if a[0] + a[1] > a[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


def main():
	test = int(input())
	for _ in range(test):
		l = int(input())
		arr = list(map(int, input().split()))
		sum = arr[0] + arr[1]
		if arr[-1] >= sum:
			print(1, 2, l)
		else:
			print(-1)
main()


import sys
t = int(input())
while t > 0:
	n = int(input())
	a = [int(x) for x in input().split()]
	s = a[0] + a[1]
	c = 0
	for i in range(2, n):
		if a[i] >= s:
			print(1, 2, i + 1)
			c += 1
			break
	if c == 0:
		print(-1)
	t -= 1


T = int(input())
for _ in range(T):
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 3:
		if arr[0] + arr[1] > arr[2]:
			print(-1)
		else:
			print(1, 2, 3)
	else:
		f1 = 1
		for i in range(n - 1):
			f = 1
			if arr[i] + arr[i + 1] <= arr[-1]:
				f = 0
				(x, y, z) = (i + 1, i + 2, n)
			if f:
				continue
			else:
				f1 = 0
				break
		if f1:
			print(-1)
		else:
			print(x, y, z)


from sys import stdin, stdout
import math, sys, heapq
from itertools import permutations, combinations
from collections import defaultdict, deque, OrderedDict
from os import path
import bisect as bi

def yes():
	print('YES')

def no():
	print('NO')
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

	def I():
		return int(input())

	def In():
		return map(int, input().split())
else:

	def I():
		return int(stdin.readline())

	def In():
		return map(int, stdin.readline().split())

def dict(a):
	d = {}
	for x in a:
		if d.get(x, -1) != -1:
			d[x] += 1
		else:
			d[x] = 1
	return d

def find_gt(a, x):
	i = bi.bisect_right(a, x)
	if i != len(a):
		return i
	else:
		return -1

def main():
	try:
		n = I()
		l = list(In())
		ans = -1
		for x in range(2, n):
			if l[0] + l[1] <= l[x]:
				ans = x
				break
		if ans == -1:
			print(-1)
		else:
			print(1, 2, ans + 1)
	except:
		pass
M = 998244353
P = 1000000007
for _ in range(I()):
	main()


for _ in range(int(input())):
	x = int(input())
	A = list(map(int, input().split()))
	if A[0] + A[1] > A[-1]:
		print(-1)
	else:
		print(1, 2, x)


def fun(a, n):
	if a[0] + a[1] <= a[-1]:
		return [1, 2, n]
	return [-1]
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	print(*fun(a, n))


from sys import *

def resolve(t):
	N = int(stdin.readline().rstrip())
	array = [int(x) for x in stdin.readline().rstrip().split()]
	a = array[0]
	b = array[1]
	c = array[N - 1]
	if c >= a + b:
		print(str(1) + ' ' + str(2) + ' ' + str(N))
		return
	print('-1')
T = int(stdin.readline().rstrip())
for t in range(T):
	resolve(t)
pass


import sys, math
import io, os
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write('\n'.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
from decimal import Decimal
from fractions import Fraction
INF = float('inf')
mod = int(1000000000.0) + 7
for t in range(int(data())):
	n = int(data())
	a = mdata()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		out(-1)


from sys import stdin, stdout
from collections import Counter
from math import ceil
from bisect import bisect_left
from bisect import bisect_right
import math
ai = lambda : list(map(int, stdin.readline().split()))
ei = lambda : map(int, stdin.readline().split())
ip = lambda : int(stdin.readline().strip())
for i in range(ip()):
	n = ip()
	li = ai()
	if li[0] + li[1] <= li[-1]:
		print(1, 2, n)
	else:
		print(-1)


def checkTriangle(arr):
	if len(arr) < 3:
		return -1
	(a, b, c) = (arr[0], arr[1], arr[-1])
	if a + b <= c:
		return (1, 2, len(arr))
	else:
		return -1
n_list = []
array_list = []
cases = int(input())
for i in range(cases):
	n_list.append(input())
	array = list(map(int, input().split()))
	array_list.append(array)
for array in array_list:
	x = checkTriangle(array)
	if x == -1:
		print(x)
	else:
		print(' '.join([str(i) for i in checkTriangle(array)]))


t = int(input())
anss = []
for _ in range(t):
	input()
	l = list(map(int, input().split(sep=' ')))
	if l[0] + l[1] > l[-1]:
		anss.append([-1])
	else:
		anss.append([1, 2, len(l)])
for ans in anss:
	for i in ans:
		print(i, end=' ')
	print()


def A(arr):
	if arr[0] + arr[1] <= arr[len(arr) - 1]:
		print(1, 2, len(arr))
	else:
		print(-1)
count = int(input())
for i in range(count):
	lne = int(input())
	arr = list(map(int, input().split()))
	A(arr)


t = int(input(''))
for i in range(t):
	la = int(input(''))
	l = [0, 1]
	a = [int(x) for x in input('').split()]
	ai = a[0]
	aj = a[1]
	for i in range(2, la):
		if ai + aj <= a[i]:
			l.append(a.index(a[i]))
			for k in l:
				print(k + 1, end=' ')
			print()
			break
	else:
		print(-1)


import collections

def solve(lst):
	if len(lst) < 3:
		return -1
	if lst[0] + lst[1] <= lst[len(lst) - 1]:
		return str(1) + ' ' + str(2) + ' ' + str(len(lst))
	return -1

def sort(key):
	return key[0]
ans = []
n = int(input())
for i in range(n):
	k = int(input())
	lst = list(map(int, input().split()))
	ans.append(solve(lst))
for i in ans:
	print(i)


import sys
input = sys.stdin.readline
t = int(input())
for tests in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	if A[0] + A[1] <= A[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	l = int(input())
	arr = [int(p) for p in input().split()]
	possible = -1
	count = 0
	a1 = arr[0]
	a2 = arr[1]
	for i in range(2, len(arr)):
		if arr[i] >= a1 + a2:
			print(1, 2, i + 1)
			count += 1
			break
	if not count:
		print(possible)


def nik(n, rud):
	print(1, 2, n) if rud[0] + rud[1] <= rud[-1] else print(-1)
for _ in range(int(input())):
	n = int(input())
	rud = list(map(int, input().split()))
	nik(n, rud)


import math
t = int(input())
for w in range(t):
	n = int(input())
	l = sorted([int(i) for i in input().split()])
	if l[0] + l[1] > l[-1]:
		print(-1)
	else:
		print(1, 2, n)


import sys
input = sys.stdin.readline

def inInt():
	return int(input())

def inStr():
	return input().strip('\n')

def inIList():
	return list(map(int, input().split()))

def inSList():
	return input().split()

def solve(n, nums):
	if nums[0] + nums[1] <= nums[len(nums) - 1]:
		print(1, 2, len(nums))
	else:
		print('-1')
t = inInt()
for case in range(t):
	n = inInt()
	nums = inIList()
	solve(n, nums)


for t in range(int(input())):
	num = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[num - 1]:
		print(-1)
	else:
		print(1, 2, num)


import math as mt

def tran(n, arr):
	if arr[0] + arr[1] > arr[-1]:
		return [-1]
	else:
		return [1, 2, n]
t = int(input())
ans = []
for i in range(t):
	n = int(input())
	arr = list(map(int, input().rstrip().split()))
	r = tran(n, arr)
	ans.append(r)
for i in ans:
	print(*i)


t = int(input())
l = []
for i in range(t):
	n = int(input())
	s = list(map(int, input().split()))
	l.append(s)
for j in l:
	if j[0] + j[1] > j[-1]:
		print(-1)
	else:
		print(1, 2, len(j))


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	flag = True
	for index in range(n - 2):
		if arr[index] + arr[index + 1] <= arr[-1]:
			print(index + 1, index + 2, n)
			flag = False
			break
	if flag:
		print('-1')


for _ in range(int(input())):
	i_liczb = int(input())
	liczby = list(map(int, input().split()))
	(a, b, c) = (liczby[0], liczby[1], liczby[-1])
	if a + b <= c:
		print(1, 2, i_liczb)
	else:
		print(-1)


def eachcase():
	s = int(input()) - 1
	n = list(map(int, input().split()))
	if n[0] + n[1] <= n[s]:
		print('1 2 ' + str(s + 1))
	else:
		print(-1)

def main():
	tcs = int(input())
	for tc in range(tcs):
		eachcase()
main()


ll = lambda : list(map(int, input().split()))
lls = lambda : list(map(str, input().split()))
st = lambda : input()
v = lambda : map(int, input().split())
ii = lambda : int(input())
from math import *
from sys import *
from datetime import datetime
from sys import stdin, stdout
import sys

def lcm(a, b):
	return a * b // gcd(a, b)
from collections import *

def modFact(n):
	p = 10 ** 9 + 7
	if n >= p:
		return 0
	result = 1
	for i in range(1, n + 1):
		result = result * i % p
	return result

def sol(y, i, cost):
	if i >= len(y) - 1:
		return cost
	o = sol(y, i + 1, cost)
	e = sol(y, i + 2, cost)
	if abs(y[i] - o) > abs(e - y[i]):
		cost += abs(y[i] - e)
	else:
		cost += abs(y[i] - o)
for _ in range(ii()):
	n = ii()
	l = ll()
	a = l[0] + l[1]
	f = 1
	for i in range(2, n):
		if a <= l[i]:
			f = 0
			break
	if f:
		print(-1)
	else:
		print(1, 2, i + 1)


import sys
import math
import collections
import operator as op
from collections import deque
from math import gcd, inf, sqrt, pi, cos, sin, ceil, log2
from bisect import bisect_right, bisect_left
from functools import reduce
from sys import stdin, stdout, setrecursionlimit
setrecursionlimit(2 ** 20)

def factorial(n):
	if n == 0:
		return 1
	return n * factorial(n - 1)

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def prime_factors(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return list(factors)

def sumDigits(no):
	return 0 if no == 0 else int(no % 10) + sumDigits(int(no / 10))
MOD = 1000000007
PMOD = 998244353
N = 10 ** 5
T = 1
T = int(stdin.readline())
for _ in range(T):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().rstrip().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


import math
from decimal import Decimal
import heapq
import copy
import heapq
from collections import deque
from collections import defaultdict
MOD = 1000000007

def na():
	n = int(input())
	b = [int(x) for x in input().split()]
	return (n, b)

def nab():
	n = int(input())
	b = [int(x) for x in input().split()]
	c = [int(x) for x in input().split()]
	return (n, b, c)

def dv():
	(n, m) = map(int, input().split())
	return (n, m)

def da():
	(n, m) = map(int, input().split())
	a = list(map(int, input().split()))
	return (n, m, a)

def dva():
	(n, m) = map(int, input().split())
	a = [int(x) for x in input().split()]
	b = [int(x) for x in input().split()]
	return (n, m, b)

def eratosthenes(n):
	sieve = list(range(n + 1))
	for i in sieve:
		if i > 1:
			for j in range(i + i, len(sieve), i):
				sieve[j] = 0
	return sorted(set(sieve))

def lol(lst, k):
	k = k % len(lst)
	ret = [0] * len(lst)
	for i in range(len(lst)):
		if i + k < len(lst) and i + k >= 0:
			ret[i] = lst[i + k]
		if i + k >= len(lst):
			ret[i] = lst[i + k - len(lst)]
		if i + k < 0:
			ret[i] = lst[i + k + len(lst)]
	return ret

def nm():
	n = int(input())
	b = [int(x) for x in input().split()]
	m = int(input())
	c = [int(x) for x in input().split()]
	return (n, b, m, c)

def dvs():
	n = int(input())
	m = int(input())
	return (n, m)

def fact(n):
	tc = []
	ans = {}
	d = 2
	while d * d <= n:
		if n % d == 0:
			tc.append(d)
			n //= d
		else:
			d += 1
	if n > 1:
		tc.append(n)
	for i in tc:
		ans[i] = ans.get(i, 0) + 1
	return ans

def to_zero(n, s):
	lst = s[0]
	ans = []
	for i in range(n):
		if lst == s[i]:
			continue
		elif lst == '0':
			lst = '1'
			ans.append(i)
		else:
			lst = '0'
			ans.append(i)
	if lst == '1':
		ans.append(n)
	return ans
for _ in range(int(input())):
	(n, a) = na()
	if a[-1] < a[0] + a[1]:
		print(-1)
	else:
		print(1, 2, n)


def check(u, v, w):
	x = u + v - w
	y = u - v + w
	z = -u + v + w
	return x <= 0 or y <= 0 or z <= 0

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if check(a[0], a[1], a[-1]):
		print(1, 2, n)
		return
	if check(a[0], a[-1], a[-2]):
		print(1, n - 1, n)
		return
	if check(a[0], a[1], a[2]):
		print(1, 2, 3)
		return
	if check(a[-3], a[-2], a[-1]):
		print(n - 2, n - 1, n)
		return
	print(-1)
t = int(input())
for _ in range(t):
	solve()


import sys, math
try:
	(sys.stdin, sys.stdout) = (open('input.txt', 'r'), open('out.txt', 'w'))
except:
	pass
from sys import stdin, stdout
mod = int(1000000000.0 + 7)
from statistics import mode
from collections import *
from math import ceil, floor, inf, factorial, gcd, log2, sqrt, log
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()

def lcm(a, b):
	return a * b // gcd(a, b)

def setbits(n):
	return bin(n).count('1')

def resetbits(n):
	return bin(n).count('0')

def modinv(n, p):
	return pow(n, p - 2, p)

def ncr(n, r):
	(num, den) = (1, 1)
	r = min(n, n - r)
	for i in range(r):
		num *= n - i
		den *= i + 1
	return num // den

def ncr_p(n, r, p):
	(num, den) = (1, 1)
	r = min(r, n - r)
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * modinv(den, p) % p

def isPrime(num):
	if num <= 1:
		return False
	if num == 2 or n == 3:
		return True
	if num % 2 == 0 or num % 3 == 0:
		return False
	m = int(num ** 0.5) + 1
	for i in range(5, m, 6):
		if num % i == 0 or num % (i + 2) == 0:
			return False
	return True

def bin_search(arr, low, high, val):
	while low <= high:
		mid = low + (high - low) // 2
		if arr[mid] == val:
			return mid
		elif arr[mid] < val:
			low = mid + 1
		else:
			high = mid - 1
	return -1

def sumofdigit(num):
	count = 0
	while num:
		count += num % 10
		num //= 10
	return count

def inputmatrix():
	(r, c) = iia()
	mat = [0] * r
	for i in range(r):
		mat[i] = iia()
	return (r, c, mat)

def prefix_sum(n, arr):
	for i in range(1, n):
		arr[i] += arr[i - 1]
	return arr

def binomial(n, k):
	if 0 <= k <= n:
		ntok = 1
		ktok = 1
		for t in range(1, min(k, n - k) + 1):
			ntok *= n
			ktok *= t
			n -= 1
		return ntok // ktok
	else:
		return 0

def divisors(n):
	res = []
	for i in range(1, ceil(sqrt(n)) + 1):
		if n % i == 0:
			if i == n // i:
				res.append(i)
			else:
				res.append(i)
				res.append(n // i)
	return res
for _ in range(ii1()):
	n = ii1()
	arr = iia()
	if arr[-1] >= arr[0] + arr[1]:
		print(1, 2, n)
	else:
		print(-1)


def call():
	n = int(input())
	l = [int(x) for x in input().split()]
	if l[0] + l[1] > l[-1]:
		print(-1)
	else:
		print(1, 2, n)
for _ in range(int(input())):
	call()


for _ in range(int(input())):
	n = int(input())
	num = [int(x) for x in input().split()]
	s = num[0] + num[1]
	for i in range(2, n):
		if s <= num[i]:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


T = int(input())
for _ in range(T):
	length = int(input())
	a = list(map(int, input().split()))
	x = a[0]
	y = a[1]
	z = a[-1]
	if x + y <= z:
		print(1, 2, len(a))
	else:
		print(-1)


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	print('1 2 ' + str(n) if len(a) >= 3 and a[0] + a[1] <= a[n - 1] else -1)


def func(arr, a):
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, a)
	else:
		print(-1)
t = int(input())
for _ in range(t):
	a = int(input())
	arr = list(map(int, input().split()))
	func(arr, a)


t = int(input())

def satisfy(a, b, c):
	return a + b > c and a + c > b and (b + c > a)
for case in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	done = False
	if not satisfy(a[0], a[n - 2], a[n - 1]):
		print(1, n - 1, n)
	elif not satisfy(a[0], a[1], a[n - 1]):
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	A = [int(_) for _ in input().split()]
	(a, b) = (A[0], A[1])
	for _ in range(2, n):
		c = A[_]
		if a + b > c and b + c > a and (a + c > b):
			continue
		else:
			print(1, 2, _ + 1)
			break
	else:
		print(-1)


from sys import stdin
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	nums = list(map(int, stdin.readline().split()))
	found = False
	for i in range(2, len(nums)):
		if nums[0] + nums[1] <= nums[i]:
			print(1, 2, i + 1)
			found = True
			break
	if not found:
		print(-1)


import time
from collections import deque

def inpt():
	return int(input())

def inpl():
	return list(map(int, input().split()))

def inpm():
	return map(int, input().split())

def solve():
	n = inpt()
	l = inpl()
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
		return
	else:
		print(-1)
		return

def main():
	m = 10 ** 9 + 7
	t = int(input())
	while t:
		t -= 1
		solve()
main()


from collections import *
from math import *
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	f = 0
	a.sort()
	if a[n - 1] >= a[0] + a[1]:
		print(1, 2, n)
	else:
		print(-1)


import copy
for ii in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	b = copy.deepcopy(a)
	b.sort()
	x = b[0]
	y = b[1]
	z = b[n - 1]
	if x + y <= z:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	tr = 0
	for i in range(0, n - 2):
		s = a[i] + a[i + 1]
		if s <= a[n - 1]:
			b = [i, i + 1, n - 1]
			tr = 1
			break
	if tr == 1:
		print(b[0] + 1, b[1] + 1, b[2] + 1)
	else:
		print('-1')


t = int(input())
for _ in range(t):
	l = int(input())
	flag = 0
	a = list(map(int, input().split(' ')))
	k = a[-1] - a[0]
	for i in range(1, l - 1):
		if a[i] <= k:
			print(1, i + 1, l, end=' ')
			flag = 1
			print()
			break
	if flag == 0:
		print('-1')


def finder(lst, sum):
	for i in range(2, len(lst)):
		if lst[i] >= sum:
			return i
	return -1
t = int(input())
result = list()
for test_case in range(t):
	n = int(input())
	lst = input()
	lst = lst.split()
	lst = list(map(int, lst))
	one_res = finder(lst, lst[0] + lst[1])
	if one_res == -1:
		result.append('-1')
	else:
		result.append('1 2 ' + str(one_res + 1))
for i in result:
	print(i)


import sys
input = sys.stdin.readline
from collections import *
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	(x, y, z) = (a[0], a[1], a[-1])
	if z >= x + y:
		print(1, 2, n)
	else:
		print(-1)


for i in range(int(input())):
	x = int(input())
	l = list(map(int, input().split()))
	hi = l[-1]
	lo = l[0]
	ne = l[1]
	if lo + ne > hi:
		print(-1)
	else:
		print('1 2', end=' ')
		print(len(l))


n = int(input())
for i in range(n):
	len_list = int(input())
	my_list = list(map(int, input().split()))
	(a, b, c) = my_list[:2] + [my_list[-1]]
	if c >= a + b:
		print(f'1 2 {len_list}')
	else:
		print('-1')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	found = 0
	if l[0] + l[1] <= l[-1]:
		print(1, 2, n)
		found = 1
	if not found:
		print(-1)


for i in range(int(input())):
	largo = int(input())
	lista = [int(j) for j in input().split()]
	solved = 0
	minimo = lista[0]
	maximo = lista[largo - 1]
	for x in range(1, largo - 1):
		if lista[x] + minimo <= maximo:
			print(1, x + 1, largo)
			solved = 1
			break
	if solved == 0:
		print(-1)


def main():
	t = int(input())
	for case in range(t):
		n = int(input())
		A = [int(x) for x in input().split()]
		flag = False
		for i in range(n - 2):
			last = n - 1
			for rt in range(n - i - 2):
				last = n - 1 - rt
				if A[i] + A[i + 1] > A[last]:
					break
				else:
					print(i + 1, i + 2, last + 1)
					flag = True
					break
			if flag:
				break
		if not flag:
			print(-1)
main()


import os
os_input = os.read(0, int(10000000.0)).split()
os_input_pos = -1
answer_list = []

def read_s():
	global os_input_pos
	os_input_pos += 1
	return os_input[os_input_pos].decode()

def read_i():
	return int(read_s())

def write_s(v):
	answer_list.append(v)

def write_i(v):
	write_s(str(v))

def print_ans():
	os.write(1, '\n'.join(answer_list).encode())
	os.write(1, '\n'.encode())
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
			else:
				stack.pop()
				if not stack:
					break
				to = stack[-1].send(to)
		return to
	return wrapped_func
T = read_i()
while T:
	T -= 1
	n = read_i()
	a = sorted([(read_i(), i + 1) for i in range(n)])
	if a[0][0] + a[1][0] > a[-1][0]:
		write_i(-1)
	else:
		ans = sorted([a[0][1], a[1][1], a[-1][1]])
		write_s(' '.join([str(x) for x in ans]))
print_ans()


def solve(N, arr):
	arr.sort()
	if arr[0] + arr[1] > arr[N - 1] and arr[0] + arr[N - 1] > arr[1] and (arr[N - 1] + arr[0] > arr[0]):
		print(-1)
	else:
		print(1, 2, N)
t = int(input())
while t != 0:
	n = int(input())
	a = list(map(int, input().split(' ')))
	solve(n, a)
	t -= 1


for _ in range(int(input())):
	n = int(input())
	alist = list(map(int, input().split()))
	flag = 0
	a = alist[0] + alist[1]
	c = 0
	for i in range(2, n):
		if a <= alist[i]:
			c = i + 1
			flag = 1
			break
	if flag == 1:
		print('1', '2', c)
	else:
		print('-1')


def fun(l):
	sum = l[0] + l[1]
	for i in range(len(l)):
		if sum <= l[i]:
			return [1, 2, i + 1]
	return [-1]
t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	ans = fun(l)
	print(*ans)


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

	def bin_search(data, target):
		low = 0
		high = len(data) - 1
		while low <= high:
			mid = (low + high) // 2
			if data[mid] >= target:
				return mid
			elif data[mid] < target:
				low = mid + 1
			else:
				high = mid - 1
		return -1
	for i in range(n - 2):
		a = bin_search(l, l[i] + l[i + 1])
		if a != -1:
			print(i + 1, i + 2, a + 1)
			break
	else:
		print(-1)


t = int(input())
while t > 0:
	n = int(input())
	a = input().split(' ')
	(i, j, k) = (0, 1, n - 1)
	if int(a[i]) + int(a[j]) <= int(a[k]) or int(a[j]) + int(a[k]) <= int(a[i]) or int(a[i]) + int(a[k]) <= int(a[j]):
		print(i + 1, j + 1, k + 1)
	else:
		print(-1)
	t -= 1


t = int(input())
while t:
	t -= 1
	n = int(input())
	ls = list(map(int, input().split()))
	flag = 0
	for i in range(len(ls) - 2):
		if ls[i] + ls[i + 1] <= ls[n - 1]:
			print(i + 1, i + 2, n)
			flag = 1
			break
	if flag == 0:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	l = [int(i) for i in input().split()]
	(a, b, c) = (l[0], l[1], l[-1])
	if a + b <= c:
		print(1, 2, n)
	else:
		print(-1)


for _ in range(int(input())):
	(n, *l) = (input(), *map(int, input().split()))
	print(' '.join(['1', '2', n]) if l[0] + l[1] <= l[-1] else -1)


tc = int(input())
for _ in range(tc):
	l = int(input())
	arr = [int(i) for i in input().split()]
	if arr[0] + arr[1] <= arr[-1]:
		print(1, 2, l)
	else:
		print(-1)


n = int(input())
for i in range(n):
	t = int(input())
	l = input()
	i_l = [int(x) for x in l.split(' ')]
	if i_l[t - 1] >= i_l[0] + i_l[1]:
		print('1 2 ' + str(t))
	else:
		print('-1')


for _ in 'T' * int(input()):
	n = int(input())
	(*k,) = [int(x) for x in input().split()]
	if k[0] + k[1] <= k[-1]:
		print(1, 2, n)
	else:
		print(-1)


def triangle(a):
	j = len(a) // 2
	for i in range(len(arr)):
		while j < len(arr):
			if a[i] + a[i + 1] <= a[j]:
				print(i + 1, i + 2, j + 1)
				return
			j += 1
	print(-1)
n = int(input())
for i in range(n):
	m = int(input())
	arr = [0] * m
	arr = list(map(int, input().split()))
	triangle(arr)


t = int(input())
while t:
	(n, v) = (int(input()), list(map(int, input().split())))
	print('1 2 ' + str(n) if v[0] + v[1] <= v[n - 1] else -1)
	t -= 1


t = int(input())
for _ in range(t):
	n = int(input())
	li = list(map(int, input().split()))
	val = False
	for i in range(2, n):
		if li[0] + li[1] <= li[i]:
			print(f'1 2 {i + 1}')
			val = True
			break
	if not val:
		print(-1)


import re
ls = lambda : list(map(int, input().split()))
ip = lambda : int(input())
sip = lambda : input()
r = lambda a: range(a)
lcm = lambda a, b: abs(a * b) // math.gcd(a, b)
t = ip()
for _ in r(t):
	n = ip()
	arr = ls()
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, len(arr))


def main():
	t = int(input())
	for tt in range(t):
		n = int(input())
		a = list(map(int, input().split()))
		if a[0] + a[1] <= a[len(a) - 1]:
			print(1, 2, len(a))
		else:
			print(-1)
main()


n_sets = int(input())
for i in range(n_sets):
	n = int(input())
	a = [int(x) for x in input().split()]
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


def f(k, arr):
	a = arr[0]
	b = arr[1]
	for i in range(k):
		if arr[i] >= a + b:
			return '1 2 ' + str(i + 1)
	return '-1'
a = input()
n = int(a)
for i in range(n):
	j = int(input())
	a = list(map(int, input().rstrip().split()))
	print(f(j, a))


from collections import defaultdict
from math import *
import os
import sys
from io import BytesIO, IOBase
from heapq import nlargest
from bisect import *
import copy
import itertools
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
t = int(input())
while t:
	t -= 1
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[-1]:
		print('-1')
	else:
		print('1 2', n)


test_cnt = int(input())
for tn in range(test_cnt):
	n = int(input())
	a = list(map(int, input().split()))
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for tt in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	flag = False
	for i in range(n - 1):
		start = i + 2
		end = n - 1
		ss = arr[i] + arr[i + 1]
		ans = -1
		while start <= end:
			mid = (start + end) // 2
			if ss <= arr[mid]:
				ans = mid
				end = mid - 1
			else:
				start = mid + 1
		if ans != -1:
			flag = True
			print(i + 1, i + 2, ans + 1)
			break
	if flag == False:
		print(-1)


def non_degenerate(t, N):
	for k in range(2, N):
		if t[0] + t[1] <= t[k]:
			return str(1) + ' ' + str(2) + ' ' + str(k + 1)
	return -1
I = input
for _ in range(int(I())):
	I()
	t = list(map(int, I().split()))
	print(non_degenerate(t, len(t)))


t = int(input())
while t > 0:
	n = int(input())
	k = 0
	list1 = list(map(int, input().split(' ')))
	e = list1[0] + list1[1]
	for a in range(2, n):
		if e <= list1[a]:
			print('' + str(1) + ' ' + str(2) + ' ' + str(a + 1))
			k = -1
			break
	if k != -1:
		print('-1')
	t = t - 1


def isTriangle(a, b, c):
	if a + b <= c or a + c <= b or b + c <= a:
		return False
	return True
t = int(input())
while t != 0:
	t -= 1
	n = int(input())
	arr = [int(x) for x in input().split()]
	if not isTriangle(arr[0], arr[1], arr[-1]):
		print('1 2', n)
	else:
		print(-1)


t = int(input())
while t > 0:
	n = int(input())
	x = list(map(int, input().split()))
	arr = list()
	arr2 = list()
	a = 0
	arr = sorted(x)
	for i in range(3, n + 1):
		if arr[i - 1] >= arr[0] + arr[1]:
			print(1, 2, i)
			a = a + 1
			break
	if a == 0:
		print(-1)
	t = t - 1


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
(m,) = I()
while m:
	m -= 1
	(n,) = I()
	arr = I()
	a = b = c = 0
	flag = 0
	for i in range(n - 1, 1, -1):
		if arr[0] + arr[1] <= arr[i]:
			print(1, 2, i + 1)
			flag = 1
			break
	if flag == 0:
		print(-1)


t = int(input())
for i in range(0, t):
	n = int(input())
	f = 0
	a = list(map(int, input().split()))
	summ = a[0] + a[1]
	for j in range(2, len(a)):
		if summ <= a[j]:
			f = j
			break
	if f == 0:
		print(-1)
	elif f != 0:
		print(1, end=' ')
		print(2, end=' ')
		print(f + 1)


for i in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	k = True
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
		k = False
	if k:
		print(-1)


n = int(input())
rez = []
for i in range(n):
	tmp = input()
	tmp = list(map(int, input().split()))
	if tmp[0] + tmp[1] <= tmp[-1]:
		rez.append(str(1) + ' ' + str(2) + ' ' + str(len(tmp)))
	else:
		rez.append(-1)
for i in range(n):
	print(rez[i])


t = int(input())

def check(a, b, c):
	if c >= b + a:
		return True
	else:
		return False
while t:
	t -= 1
	n = int(input())
	a = [int(i) for i in input().split()]
	a.sort()
	if check(a[0], a[1], a[-1]):
		print(1, 2, n)
	else:
		print(-1)


for T in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a1 = l[0]
	a2 = l[1]
	a3 = l[-1]
	if a1 + a2 <= a3:
		print(str(1) + ' ' + str(2) + ' ' + str(n))
	else:
		print(-1)


t = int(input())
for m in range(t):
	n = int(input())
	a_n = [int(i) for i in input().split()]
	if a_n[0] + a_n[1] <= a_n[-1]:
		print(1, 2, n)
	else:
		print(-1)


import bisect
for _ in range(int(input())):
	n = int(input())
	a = [int(s) for s in input().split()]
	i = 0
	j = 0
	f = 0
	while i < n - 1:
		s = a[i] + a[i + 1]
		j = bisect.bisect_left(a, s)
		if j < n:
			f = 1
			break
		i += 1
	if f:
		print(i + 1, i + 2, j + 1)
	else:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	k = 0
	l = list(map(int, input().split(' ')))
	s = l[0] + l[1]
	for a in range(2, n):
		if s <= l[a]:
			print('' + str(1) + ' ' + str(2) + ' ' + str(a + 1))
			k = -1
			break
	if k != -1:
		print('-1')


for _ in range(int(input())):
	N = int(input())
	A = list(map(int, input().split()))
	A = [[A[i], i + 1] for i in range(N)]
	A.sort()
	if A[0][0] + A[1][0] <= A[-1][0]:
		ans = [A[0][1], A[1][1], A[-1][1]]
	else:
		ans = [-1]
	ans.sort()
	print(*ans)


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()))
	lowestSum = array[0] + array[1]
	if array[n - 1] < lowestSum:
		print(-1)
	else:
		print(1, 2, n)
main()


import sys
for bruh in range(0, int(sys.stdin.readline())):
	leng = int(sys.stdin.readline())
	vals = list(map(int, sys.stdin.readline().split()))
	if vals[0] + vals[1] > vals[leng - 1]:
		sys.stdout.write('-1\n')
	else:
		sys.stdout.write('1 2 ' + str(leng) + '\n')


import io
import os
import sys
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def prdbg(*args, **kwargs):
	print(*args, **kwargs)
	pass

def get_str():
	return input().decode().strip()

def rint():
	return map(int, input().split())

def oint():
	return int(input())
t = oint()
for _ in range(t):
	n = oint()
	a = list(rint())
	b = a[0] + a[1]
	for i in range(n - 1, 1, -1):
		if a[i] >= b:
			print(1, 2, i + 1)
			break
	else:
		print(-1)


for i in range(int(input())):
	N = int(input())
	side_array = list(map(int, input().split()))
	for i in range(2, N):
		if side_array[0] + side_array[1] <= side_array[i]:
			flag = 1
			d = i
			break
		else:
			flag = 0
	if flag == 1:
		print(1, 2, d + 1)
	else:
		print(-1)


def trian(arr):
	if arr[0] + arr[1] > arr[-1]:
		print(-1)
	else:
		print(1, 2, len(arr))
t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	trian(arr)


t = int(input())
for _ in range(t):
	n = int(input())
	inp = [int(i) for i in input().split()]
	if inp[0] + inp[1] <= inp[n - 1]:
		print(1, 2, n)
	else:
		print(-1)


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	c = 0
	d = 0
	for i in range(2, n):
		if a[0] + a[1] <= a[i]:
			c = 1
			d = i
			break
	if c == 1:
		print(1, 2, d + 1)
	else:
		print(-1)


import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
ORDA = 97

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return [int(i) for i in input().split()]

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=2):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def divn(n, primes):
	divs_number = 1
	for i in primes:
		if n == 1:
			return divs_number
		t = 1
		while n % i == 0:
			t += 1
			n //= i
		divs_number *= t

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	new_number = 0
	while number > 0:
		new_number += number % base
		number //= base
	return new_number

def cdiv(n, k):
	return n // k + (n % k != 0)

def ispal(s):
	for i in range(len(s) // 2 + 1):
		if s[i] != s[-i - 1]:
			return False
	return True
for _ in range(ii()):
	n = ii()
	a = li()
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	f = 0
	for j in range(2, n):
		if l[0] + l[1] <= l[j]:
			print(1, 2, j + 1, sep=' ')
			f = 1
			break
	if f == 0:
		print(-1)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split(' ')))
	chk = 0
	for x in range(n - 2):
		if a[x] + a[x + 1] <= a[n - 1]:
			print(x + 1, x + 2, n)
			chk = 1
			break
	if chk == 0:
		print(-1)


def run():
	num = int(input())
	nums = [int(i) for i in input().split()]
	if nums[0] + nums[1] <= nums[-1]:
		print(1, 2, num)
	else:
		print(-1)
n = int(input())
for i in range(n):
	run()


import sys

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return map(int, minp().split())

def solve():
	n = mint()
	d = [None] * n
	i = 0
	for v in mints():
		d[i] = (v, i + 1)
		i += 1
	d.sort()
	(a, b, c) = (d[0], d[1], d[-1])
	if a[0] + b[0] <= c[0]:
		print(*sorted([a[1], b[1], c[1]]))
	else:
		print(-1)
for i in range(mint()):
	solve()


for _ in range(int(input())):
	n = int(input())
	x = list(map(int, input().split()))
	c = sum(x[0:2])
	if n < 3:
		print(-1)
	elif c > x[-1]:
		print(-1)
	else:
		print(1, 2, n)


for _ in range(int(input())):
	n = int(input())
	x = list(map(int, input().split()))
	f = 0
	mx = max(x)
	h = x.index(mx)
	for i in range(n - 2):
		if i != h and i + 1 != h and (x[i] + x[i + 1] <= mx):
			print(i + 1, i + 2, h + 1)
			f = 1
			break
	if not f:
		print(-1)


for i in range(int(input())):
	n = int(input())
	chk = [int(i) for i in input().split()]
	if chk[0] + chk[1] > chk[-1]:
		print(-1)
	else:
		print(1, 2, n)


import collections
from functools import lru_cache

def read():
	return input().strip()

def readInt():
	return int(input().strip())

def readList():
	return list(map(int, input().strip().split()))

def solve(N, arr):
	(a, b, c) = (arr[0], arr[1], arr[-1])
	if a + b <= c:
		return ' '.join(map(str, [1, 2, N]))
	else:
		return '-1'
t = readInt()
for i in range(t):
	N = readInt()
	arr = readList()
	print(solve(N, arr))


TEST_CASES = int(input())
for i in range(TEST_CASES):
	NUMBERS_COUNT = int(input())
	NUMBERS = [int(i) for i in input().split()]
	sum_start = NUMBERS[0] + NUMBERS[1]
	end = NUMBERS[-1]
	if sum_start <= end:
		print(f'1 2 {NUMBERS_COUNT}')
	else:
		print('-1')


from sys import stdin, stdout
from math import gcd, sqrt, factorial
from collections import deque, defaultdict
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\n')
L = lambda : list(R())
P = lambda x: stdout.write(x)
lcm = lambda x, y: x * y // gcd(x, y)
hg = lambda x, y: (y + x - 1) // x * x
pw = lambda x: 0 if x == 1 else 1 + pw(x // 2)
chk = lambda x: chk(x // 2) if not x % 2 else True if x == 1 else False
sm = lambda x: (x ** 2 + x) // 2
N = 10 ** 9 + 7
for i in range(I()):
	n = I()
	a = L()
	if sum(a[:2]) > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


for s in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	add = a[0] + a[1]
	flag = 0
	for i in range(2, n):
		if a[i] >= add:
			flag = -1
			break
	if flag == 0:
		print(-1)
	else:
		print(1, 2, i + 1)


t = int(input())
while t > 0:
	n = int(input())
	a = list(map(int, input().split()))
	s = a[0] + a[1]
	ans = -1
	for i in range(2, n):
		if a[i] >= s:
			ans = i
		else:
			continue
	if ans != -1:
		print('1 2 ' + str(ans + 1))
	else:
		print(ans)
	t -= 1


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
t = II()
for q in range(t):
	n = II()
	a = sorted(LI())
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


def resolve():
	N = int(input())
	for _ in range(N):
		length_of_array = int(input())
		A = [int(x) for x in input().split(' ')]
		isFound = False
		for i in range(length_of_array - 2):
			if A[i] + A[i + 1] <= A[length_of_array - 1]:
				isFound = True
				print(i + 1, i + 2, length_of_array)
				break
		if not isFound:
			print(-1)
resolve()


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
from collections import Counter
inp = lambda : int(input())
strng = lambda : input().strip()
jn = lambda x, l: x.join(map(str, l))
strl = lambda : list(input().strip())
mul = lambda : map(int, input().strip().split())
mulf = lambda : map(float, input().strip().split())
seq = lambda : list(map(int, input().strip().split()))
ceil = lambda x: int(x) if x == int(x) else int(x) + 1
ceildiv = lambda x, d: x // d if x % d == 0 else x // d + 1
flush = lambda : stdout.flush()
stdstr = lambda : stdin.readline()
stdint = lambda : int(stdin.readline())
stdpr = lambda x: stdout.write(str(x))
stdarr = lambda : map(int, stdstr().split())
mod = 1000000007
for _ in range(stdint()):
	n = stdint()
	arr = list(stdarr())
	a = arr[-1]
	b = arr[1]
	c = arr[0]
	if b + c > a:
		print(-1)
	else:
		print(1, 2, n)


q = int(input())
while q > 0:
	q = q - 1
	n = int(input())
	lst = [None] * n
	lst = list(map(int, input().split()))
	if lst[0] + lst[1] <= lst[-1]:
		print(1, 2, n)
	else:
		print(-1)


for t in range(int(input())):
	n = int(input())
	aa = [int(s) for s in input().split(' ')]
	mins = [0] * n
	maxs = [0] * n
	mins[0] = aa[0]
	maxs[n - 1] = aa[n - 1]
	for i in range(1, n):
		mins[i] = min(mins[i - 1], aa[i])
	for i in reversed(range(n - 1)):
		maxs[i] = max(maxs[i + 1], aa[i])
	found = False
	for i in range(1, n - 1):
		left = mins[i - 1]
		right = maxs[i + 1]
		if aa[i] + left <= right:
			found = True
			print(aa.index(left) + 1, i + 1, aa[i + 1:].index(right) + i + 1 + 1)
			break
	if not found:
		print(-1)


tests = int(input())
for current_test in range(tests):
	n = int(input())
	lst = list(map(int, input().strip().split()))[:n]
	if n >= 3:
		if lst[0] + lst[1] <= lst[n - 1]:
			print(1, 2, n)
		else:
			print(-1)
	else:
		print(-1)


for _ in range(int(input())):
	n = int(input())
	val = list(map(int, input().strip().split()))
	index = [1, 2]
	sum_tri = val[0] + val[1]
	for i in range(2, len(val)):
		if val[i] >= sum_tri:
			index.append(i + 1)
			print(*index)
			break
		if i + 1 == len(val):
			print('-1')
			break


t = int(input())
a = []
b = []
for i in range(t):
	p = int(input())
	h = list(map(int, input().split()))
	a.append(p)
	b.append(h)

def tully(a, b):
	flag = 1
	p = -1
	for i in range(2, a):
		if b[0] + b[1] <= b[i]:
			flag = 0
			p = i
			break
	return p
for i in range(t):
	y = tully(a[i], b[i])
	if y == -1:
		print('-1')
	else:
		print(f'1 2 {y + 1}')


from sys import stdin, stdout
from collections import Counter, deque
import math
input = stdin.readline
print = stdout.write

def inpn():
	return int(input())

def inpl():
	return list(map(int, input().split()))

def inps():
	return input()

def invr():
	return map(int, input().split())

def outs(s):
	print(s)

def outn(n):
	print(str(n))

def outl(l):
	for i in l:
		print(str(i))
for _ in range(int(input())):
	n = inpn()
	l = inpl()

	def bin_search(data, target):
		low = 0
		high = len(data) - 1
		while low <= high:
			mid = (low + high) // 2
			if data[mid] >= target:
				return mid
			elif data[mid] < target:
				low = mid + 1
			else:
				high = mid - 1
		return -1
	for i in range(n - 2):
		a = bin_search(l, l[i] + l[i + 1])
		if a != -1:
			outn(i + 1)
			print(' ')
			outn(i + 2)
			print(' ')
			outn(a + 1)
			print('\n')
			break
	else:
		outn(-1)
		print('\n')


for i in range(int(input())):
	a = int(input())
	b = list(map(int, input().strip().split()))[:a]
	if len(b) < 3:
		print(-1)
	else:
		sum = b[0] + b[1]
		if sum <= b[-1]:
			print(str(1) + ' ' + str(2) + ' ' + str(len(b)))
		else:
			print(-1)


for _ in range(int(input())):
	n = int(input())
	li = list(map(int, input().strip().split()))
	if li[0] + li[1] > li[-1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	for i in range(len(arr)):
		if arr[i] + arr[i + 1] <= arr[len(arr) - 1]:
			print(i + 1, i + 2, len(arr))
			break
		else:
			print(-1)
			break


import math
T = int(input())
lets = 'abcdefghijklmnopqrstuvwxyz'
key = {lets[i]: i for i in range(26)}
for i in range(T):
	n = int(input())
	a = list(map(int, input().split()))
	d = False
	if a[0] + a[1] <= a[-1]:
		print(1, 2, n)
	else:
		print(-1)


from math import *
sInt = lambda : int(input())
mInt = lambda : map(int, input().split())
lInt = lambda : list(map(int, input().split()))
t = sInt()
for _ in range(t):
	n = sInt()
	a = lInt()
	if a[0] + a[1] > a[-1]:
		print(-1)
	else:
		print(1, 2, n)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	x = True
	for i in range(1, n):
		if a[i] + a[0] <= a[-1]:
			print(1, i + 1, n, sep=' ')
			x = False
			break
	if x:
		print(-1)


T = int(input())
for case in range(T):
	i = int(input())
	ls = [int(x) for x in input().split()]
	if ls[0] + ls[1] <= ls[-1]:
		print(1, 2, len(ls))
	else:
		print(-1)


import sys, io, os, time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect, math, heapq
alphabet = 'abcdefghijklmnopqrstuvwxyz'
input = sys.stdin.readline
for ii in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if arr[0] + arr[1] > arr[n - 1]:
		print(-1)
	else:
		print(1, 2, n)


t = int(input())
r = ''
for i in range(t):
	n = int(input())
	a = []
	a = input().split()
	if int(a[0]) + int(a[1]) <= int(a[len(a) - 1]):
		r += '1 2 ' + str(len(a)) + '\n'
	else:
		r += '-1\n'
print(r)


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	notexist = False
	for i in range(2, len(arr)):
		if arr[0] + arr[1] <= arr[i]:
			n = i + 1
			notexist = True
			break
	if notexist:
		print(1, 2, n)
	else:
		print(-1)


t = int(input())
for i in range(t):
	n = int(input())
	s = input().split()
	ls = []
	for j in range(len(s)):
		ls.append(int(s[j]))
	c = ls[n - 1]
	a = ls[0]
	b = ls[1]
	if a + b > c:
		print(-1)
	else:
		(print(1),)
		(print(2),)
		print(n)


from sys import stdin

def main():
	input = lambda : stdin.readline()[:-1]
	T = int(input())
	for _ in [0] * T:
		N = int(input())
		A = list(map(int, input().split()))
		if A[0] + A[1] <= A[-1]:
			print(1, 2, N)
		else:
			print(-1)
main()


t = int(input())
n = []
s = []
for i in range(t):
	n.append(int(input()))
	s.append(list(map(int, input().split())))
for j in range(t):
	f = 0
	if s[j][0] + s[j][1] <= s[j][n[j] - 1]:
		print(1, 2, n[j])
		f = 1
	if not f:
		print(-1)


def test(a, b, c):
	if a + b <= c or b + c <= a or a + c <= b:
		return False
	return True
n = int(input())
ans = []
for i in range(n):
	key = True
	n = int(input())
	(a, b, c) = (0, 1, n - 1)
	m = [int(j) for j in input().split()]
	for j in range(1, n - 1):
		b = j
		if not test(m[a], m[b], m[c]):
			key = False
			break
	if key:
		ans.append([-1])
	else:
		ans.append([a + 1, b + 1, c + 1])
for i in ans:
	print(*i)


import bisect

def solve(arr, n, ans):
	for j in range(1, n):
		total = arr[j] + arr[0]
		k = bisect.bisect(arr, total - 1)
		if k != len(arr):
			ans.append('1' + ' ' + str(j + 1) + ' ' + str(k + 1))
			return
	ans.append('-1')

def main():
	t = int(input())
	ans = []
	for i in range(t):
		n = int(input())
		arr = list(map(int, input().split()))
		solve(arr, n, ans)
	print('\n'.join(ans))
main()


t = int(input())
arrays = []
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	arrays.append(a)

def func(arr: list):
	if arr[0] + arr[1] > arr[len(arr) - 1]:
		print(-1)
		return
	else:
		print(f'1 2 {len(arr)}')
		return
for arr in arrays:
	func(arr)


def solve(arr):
	ans = []
	s = arr[0] + arr[1]
	if s <= arr[-1]:
		print(1, 2, len(arr))
	else:
		print(-1)
t = int(input())
for i in range(t):
	input()
	solve(list(map(int, input().split())))


from sys import stdin, stdout
from collections import defaultdict
import math
for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a = l[0]
	b = l[1]
	c = l[-1]
	if a + b <= c:
		print(1, 2, n)
	else:
		print(-1)


n = int(input())
result = []
for i in range(n):
	num = int(input())
	l = list(map(int, input().split()))
	maximum = max(l)
	flag = 0
	for i in range(len(l) - 2):
		a = l[i]
		b = l[i + 1]
		s = a + b
		if s <= maximum:
			flag = 1
			result.append([i + 1, i + 2, num])
			break
	if flag == 0:
		result.append(0)
else:
	for i in result:
		if i == 0:
			print(-1)
		else:
			for ele in i:
				print(ele, end=' ')
			print()


import sys
import math, bisect
from collections import defaultdict
from itertools import groupby, accumulate
from heapq import heapify, heappop, heappush
from collections import deque, Counter, OrderedDict

def neo():
	return map(int, input().split())

def Neo():
	return list(map(int, input().split()))
for _ in range(int(input())):
	N = int(input())
	A = Neo()
	if A[0] + A[1] > A[-1]:
		print(-1)
	else:
		print(1, 2, N)


from sys import stdin, stdout
import bisect
from bisect import bisect_left as bl
from bisect import bisect_right as br
import itertools
from collections import Counter
from math import sqrt
import collections
import math
import heapq
import re

def modinv(n, p):
	return pow(n, p - 2, p)

def cin():
	return map(int, sin().split())

def ain():
	return list(map(int, sin().split()))

def sin():
	return input()

def inin():
	return int(input())

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def most_frequent(list):
	return max(set(list), key=list.count)

def GCD(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def ncr(n, r, p):
	t = fact[n] * (ifact[r] * ifact[n - r] % p) % p
	return t

def Convert(string):
	li = list(string.split(''))
	return li

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
prime = []
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j

def main():
	for _ in range(inin()):
		n = inin()
		a = ain()
		flag = 0
		if a[0] + a[1] <= a[-1]:
			print(1, 2, n)
		else:
			print(-1)
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()