/*----------------*/
/*  ^_HAR HAR MAHADEV_^
    |Om namah shivaya|
*/
#include <bits/stdc++.h>
//For ordered_set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mod 1000000007
#define test  \
    int t;    \
    cin >> t; \
    while (t--)
#define f(i, a, b) for (int i = a; i < b; i++)
#define fr(i, a, b) for (int i = a; i >= b; i--)
#define ll long long int
#define F first
#define S second
#define fast                          \
    ios_base::sync_with_stdio(false); \
    cin.tie();                        \
    cout.tie();
#define FILE_READ_IN freopen("input.txt", "r", stdin);
#define FILE_READ_OUT freopen("output.txt", "w", stdout);
#define br "\n"
using namespace std;
// For ordered_set
using namespace __gnu_pbds;
template <typename T>
using ord_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll maxn = 1e5;
const double pi = acos(-1);

bool prime(ll a)
{
    if (a == 1)
        return false;
    if (a == 2 || a == 3)
        return true;
    if (a % 2 == 0 || a % 3 == 0)
        return false;
    for (ll i = 5; i <= sqrt(a); i += 6)
        if (a % i == 0 || a % (i + 2) == 0)
            return false;
    return true;
}
ll power(ll x, ll y)
{
    if (y == 0)
        return 1;
    ll p = power(x, y / 2) % mod;
    p = (p * p) % mod;

    return (y % 2 == 0) ? p : (x * p) % mod;
}
ll nCr(ll n, ll k)
{
    ll C[k + 1];
    f(i, 0, k + 1) C[i] = 0;
    C[0] = 1;

    for (ll i = 1; i <= n; i++)
    {
        for (ll j = min(i, k); j > 0; j--)
            C[j] = (C[j] + C[j - 1]) % mod;
    }
    return C[k];
}
ll LOGN(ll n, ll r)
{
    return (n > r - 1) ? (1 + LOGN(n / r, r)) : 0;
}
void solve()
{
    int n;
    cin >> n;
    ll a[n];
    f(i, 0, n)
    {
        cin >> a[i];
    }
    bool ok = 0;
    if (a[0] + a[1] < a[n - 1])
    {
        ok = 1;
        cout << "1 2 " << n << "\n";
    }
    if (!ok)
    {
        cout << "-1\n";
    }
}
int main()
{
    fast;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}
