#include <bits/stdc++.h>
using namespace std;
template <class T>
void read_v(T& x, std::istream& in) {
  in >> (x);
}
template <class A>
void read_vec(vector<A>& x, std::istream& in) {
  for (auto& a : x) read_v(a, in);
}
bool sortpairbysec(const pair<long long, long long>& a,
                   const pair<long long, long long>& b) {
  return (a.second < b.second);
}
template <typename T>
T factmod(T a, T modulus) {
  long long res = 1, i;
  for (i = 2; i <= a; i++) {
    res *= i;
    res %= modulus;
  }
  return res;
}
template <typename T>
long long powmod(T a, T b, long long m) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) {
      ans *= a;
      ans %= m;
    }
    a *= a;
    a %= m;
    b >>= 1;
  }
  return ans;
}
template <typename T>
long long power(T a, T b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) {
      ans *= a;
    }
    a *= a;
    b >>= 1;
  }
  return ans;
}
void ssolve(std::istream& in, std::ostream& out) {
  long long n;
  in >> n;
  vector<long long> a(n);
  read_vec(a, in);
  if (a[0] + a[1] < a[n - 1]) {
    out << 1 << ' ' << 2 << ' ' << n << endl;
  } else if (n >= 4 && (a[0] + a[n - 2] < a[n - 1])) {
    out << 1 << ' ' << n - 1 << ' ' << n << endl;
  } else {
    out << -1 << endl;
  }
  return;
}
class ABadTriangle {
 public:
  void solve(std::istream& in, std::ostream& out) {
    ios_base::sync_with_stdio(false);
    in.tie(nullptr);
    out.tie(nullptr);
    long long t;
    long long READ = 1;
    if (READ)
      in >> t;
    else
      t = 1;
    while (t--) {
      ssolve(in, out);
    }
  }
};
long long main() {
  ABadTriangle solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
}
