#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    long long ar[n + 5];
    for (int i = 0; i < n; i++) cin >> ar[i];
    vector<int> left(n + 5), right(n + 5);
    left[0] = 0;
    for (int i = 1; i < n; i++) {
      if (ar[i] < ar[left[i - 1]]) left[i] = i;
      left[i] = left[i - 1];
    }
    right[n - 1] = n - 1;
    for (int i = n - 2; i >= 0; i--) {
      if (ar[i] < ar[right[i + 1]])
        right[i] = i;
      else
        right[i] = right[i + 1];
    }
    bool f = false;
    vector<int> ans;
    for (int i = 1; i < n - 1; i++) {
      vector<long long> temp = {ar[i], ar[left[i - 1]], ar[right[i + 1]]};
      sort(temp.begin(), temp.end());
      if (temp[0] + temp[1] <= temp[2]) {
        f = true;
        ans = {left[i - 1] + 1, i + 1, right[i + 1] + 1};
        break;
      }
    }
    if (f == false)
      cout << -1 << endl;
    else
      cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
  }
  return 0;
}
