#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> order_set;

#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

using namespace std;

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("input.txt","r",stdin); //freopen("mowlawn.out","w",stdout);
    int T;

    cin>>T;

    while (T--) {
        int n,m,k;

        cin>>n;

        vector<int> a(n);

        for (int i=0; i<n; i++) cin>>a[i];

        if (a[0]+a[1]<a[n-1])
            cout<<1<<' '<<2<<' '<<n;
        else
            cout<<-1;
        cout<<endl;

    }

    return 0;
}
