
    #include<bits/stdc++.h> 
    using namespace std; 
    #pragma GCC optimize("Ofast")
	#pragma GCC target("avx,avx2")
	#include <ext/pb_ds/tree_policy.hpp>
	
	#define pb push_back
	#define fi first
	#define sec second
	#define sz(x) ((long long)x.size())

	#define  n_p  next_permutation
	#define  p_p  prev_permutation

	typedef long long ll;
	typedef long double ld;
	typedef complex<ld> cd;

	typedef pair<int, int> pi;
	typedef pair<ll,ll> pl;
	typedef pair<ld,ld> pd;

	typedef vector<int> vi;
	typedef vector<ld> vd;
	typedef vector<ll> vl;
	typedef vector<pi> vpi;
	typedef vector<pl> vpl;
	typedef vector<pd> vpd;
	typedef vector<cd> vcd;


	//////////////////////////////////////////////////////////////////////////////////////////////
	/*          priority_queues             */

	 // highest first
	 typedef priority_queue< int >    pq_i;
	 typedef priority_queue< ll >     pq_l;
	 typedef priority_queue< ld >     pq_d;

	 //          lowest first
	 typedef priority_queue<int,vi,greater<int>>         qp_i;
	 typedef priority_queue<ll , vl , greater<ll> >      qp_l ;
	 typedef priority_queue<ld ,vd , greater<ld> >      qp_d;


	//////////////////////////////////////////////////////////////////////////////////////////////



	#define trav(a,x)       for(auto &a:x)
	#define all(con)        con.begin(),con.end()
	#define lb_( con , x )  lower_bound(all(con) ,x)
  #define ub_( con , x )  upper_bound(all(con) ,x)
  #define er_( con , x )  equal_range(all(con) ,x)
  #define gtl(s)          getline(cin , s)

	#define nl '\n'
	#define dd ' '
	#define re  return 0
  #define oo 1<<30
/*********************************** your code starts here ************************************************/



void solve(); 


int main() 
{ 
   ios_base::sync_with_stdio(false);cin.tie(NULL); 

     #ifndef ONLINE_JUDGE 
        freopen("input.txt", "r", stdin); 
        freopen("error.txt", "w", stderr); 
        freopen("output.txt", "w", stdout); 
     #endif 


  int t=1; 
  cin>>t;  ////////////////////////////////////     dont forget this ever        ////////////////////////////////////////
        while(t--)  
            { 
            	solve(); 
            } 

       cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl; 
  return 0; 
} 



/*****************************************************************************/


  void solve() 
    {
           int n ;
            cin>>n;
            int p , q , r ;
            
             cin>>p>>q;
             int dm;
             for( int g = 1 ; g< n-2 ; g++)
                {
                      cin>>dm;
                }

                cin>>r;

         if( p+q < r ){ cout<<1<<dd<<2<<dd<<n<<nl;  }
         else { cout<<-1<<nl; }

    }


/*****************************************************************************/



