#include <bits/stdc++.h>
using namespace std;
bool sortbyff(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first < b.first);
}
bool crsort(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.second != b.second) return (a.second < b.second);
  return (a.first < b.first);
}
bool rcsort(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first != b.first) return (a.first < b.first);
  return (a.second < b.second);
}
typedef struct {
  unsigned int start;
  unsigned int finish;
  unsigned int index;
} job;
int compare_jobs(const job *job1, const job *job2) {
  if (job1->finish < job2->finish) return -1;
  if (job1->finish == job2->finish) return 0;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  bool flag = 0;
  long n, m, k, l, r, d, i, j, q, t, u, x, y, z, sum = 0, ans = 0, size, p = 0,
                                                 M = 998244353;
  cin >> t;
  while (t--) {
    cin >> n;
    int a[n];
    for (i = 0; i < n; i++) cin >> a[i];
    if (n >= 3 && a[0] + a[1] < a[n - 1])
      cout << 1 << " " << 2 << " " << n << "\n";
    else
      cout << "-1\n";
  }
}
