#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
const long long MOD = 1000000007;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto &(z) : a) cin >> z;
  ;
  for (int(i) = (0); (i) < (n - 2); ++(i)) {
    if ((a[i] + a[i + 1] <= a[i + 2]) || (a[i] + a[i + 2] <= a[i + 1]) ||
        (a[i + 1] + a[i + 2] <= a[i])) {
      printf("%d %d %d\n", i + 1, i + 2, i + 3);
      return;
    }
  }
  cout << -1 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc;
  cin >> tc;
  while (tc--) solve();
  return 0;
}
