#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

bool isPrime(ll x)
{
    for(ll i=2;i<=sqrt(x);i++)
    {
        if(x%i==0)
            return false;
    }
    return true;
}
ll lcm(ll x,ll y)
{
    ll z = x*y;
    return z/__gcd(x,y);
}

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    ll t=1,n,m,a,i,j,b=0,d,c,q,x=0,y=0,ans=0,sum=0,k;








    cin>>t;
    while(t--)
    {
       
  cin>>n;
  vector <ll> v(n);
  for(i=0;i<n;i++)
    cin>>v[i];
  x = v[n-1]-v[0];
  if(x>v[1])
    cout<<1<<" "<<2<<" "<<n<<endl;
  else
    cout<<-1<<endl;




    }










    return 0;
}
