#include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
const int MOD = 1e9 + 7;
int dp[210][420];
long long m, n;
int a[210], b[210];
void fast() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    gcd(b, a % b);
}
long long lcd(long long a, long long b) { return (a * b) / gcd(a, b); }
bool f(long long a, long long b) { return a > b; }
long long max_sum_subarrays(long long ara[], long long n) {
  long long ans = 0, sum = 0;
  for (long long k = 0; k < n; k++) {
    sum = max(ara[k], sum + ara[k]);
    ans = max(ans, sum);
  }
  return ans;
}
long long num_divisors(long long n) {
  long long cnt = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0 && i * i == n) cnt += 1;
    if (n % i == 0 && i * i != n) cnt += 2;
  }
  return cnt;
}
long long comb(long long m, long long n) {
  long long x = max(m - n, n), ans = 1, i = 1;
  for (long long k = m; k >= x + 1; k--) {
    ans *= k;
    ans /= i;
    i++;
  }
  return ans;
}
void solve() {
  int t;
  cin >> t;
  while (t--) {
    int n, i, j;
    cin >> n;
    int ara[n];
    for (int i = 0; i < n; i++) {
      cin >> ara[i];
    }
    bool f = 0;
    for (i = 0; i < n - 2; i++) {
      for (j = i + 1; j < n; j++) {
        if (ara[i] + ara[j] <= ara[j + 1]) {
          f = 1;
          break;
        }
      }
      if (f) break;
    }
    if (f) {
      cout << i + 1 << " " << j + 1 << " " << j + 2 << endl;
    } else
      cout << "-1" << endl;
  }
}
int main() {
  fast();
  solve();
  return 0;
}
