#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
void test() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  bool ok = true;
  for (long long i = 2; i < n; i++) {
    if (a[n - 1] > a[i - 1] + a[i - 2]) {
      cout << i - 1 << " " << i << " " << n << endl;
      return;
    } else {
      cout << -1 << endl;
      return;
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    test();
  }
  return 0;
}
