#include <bits/stdc++.h>
using namespace std;
long long int Powerm(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int t = Powerm(a, b / 2, m);
  t = (t * t) % m;
  if (b & 1) t = (t * a) % m;
  return t;
}
long long int Power(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  long long int t = Power(a, b / 2);
  t = (t * t);
  if (b & 1) t = (t * a);
  return t;
}
long long int Gcd(long long int a, long long int b) {
  if (b == 0) {
    return a;
  } else {
    return Gcd(b, a % b);
  }
}
long long int LeftMostSetBit(long long int n) {
  if (n == 0) {
    return 0;
  }
  long long int msb = 0;
  while (n != 0) {
    n = n / 2;
    msb++;
  }
  return msb;
}
long long int RightMostSetBit(long long int n) { return __builtin_ffsl(n); }
long long int LLsqrt(long long int x) {
  if (x == 0 || x == 1) return x;
  long long int start = 1, end = x / 2, ans;
  while (start <= end) {
    long long int mid = (start + end) / 2;
    if (mid * mid == x)
      return mid;
    else if (mid <= x / mid)
      ans = mid, start = mid + 1;
    else
      end = mid - 1;
  }
  return ans;
}
void input() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  input();
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int a[n];
    for (long long int i = 0; i < n; i++) {
      cin >> a[i];
    }
    long long int maxi = a[n - 1];
    long long int flag = 0;
    for (long long int i = 0; i < n - 2; i++) {
      if (a[i] + a[i + 1] <= a[i + 2]) {
        cout << i + 1 << " " << i + 2 << " " << i + 3 << endl;
        flag = 1;
        break;
      }
    }
    if (!flag) cout << -1 << endl;
  }
}
