#include <bits/stdc++.h>
using namespace std;
long long gcd(long long n, long long m) {
  if (n % m == 0) {
    return m;
  } else {
    return gcd(n, n % m);
  }
}
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
long long solve(long long a, long long b) { return (a & b) ^ (a | b); }
int main() {
  int n, t;
  cin >> t;
  while (t--) {
    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 << endl;
    else
      cout << -1 << endl;
  }
}
