#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 0;
  cin >> t;
  while (t--) {
    int n = 0;
    cin >> n;
    vector<pair<int, int> > a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i].first;
      a[i].second = i + 1;
    }
    sort((a).begin(), (a).end());
    bool ans = 0;
    for (int i = 2; i < n; i++) {
      if (!(a[i].first + a[i - 1].first > a[i - 2].first &&
            a[i - 1].first + a[i - 2].first > a[i].first &&
            a[i - 2].first + a[i].first > a[i - 1].first)) {
        vector<int> an(3);
        an[0] = a[i].second;
        an[1] = a[i - 1].second;
        an[2] = a[i - 2].second;
        sort((an).begin(), (an).end());
        cout << an[0] << ' ' << an[1] << ' ' << an[2] << endl;
        ans = true;
        break;
      }
    }
    if (!ans) cout << "-1\n";
  }
  return 0;
}
