#include <bits/stdc++.h>
using namespace std;
long long a[50005], n, i, t;
void solve() {
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  long long tmp = a[0] + a[1];
  for (i = 2; i < n; i++)
    if (tmp <= tmp) {
      cout << 1 << " " << 2 << " " << i + 1 << '\n';
      return;
    }
  cout << -1 << '\n';
}
int main() {
  cin >> t;
  while (t--) solve();
}
