#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long arr[n];
    for (int i = 0; i < n; ++i) cin >> arr[i];
    pair<long long, long long> big[n];
    big[n - 1].first = arr[n - 1];
    big[n - 1].second = n;
    for (int j = n - 2; j >= 0; --j) {
      if (arr[j] > big[j + 1].first) {
        big[j].first = arr[j];
        big[j].second = j + 1;
      } else {
        big[j] = big[j + 1];
      }
    }
    bool checker = true;
    for (int i = 0; i < n - 2; ++i)
      if (arr[i] + arr[i + 1] < big[i + 2].first) {
        cout << i + 1 << " " << i + 2 << " " << big[i + 2].second << endl;
        checker = false;
        i = n;
        break;
      }
    if (checker) cout << -1 << endl;
  }
}
