#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int findchar(string s, char c) {
  int i = 0;
  while (i < s.length()) {
    if (s[i] == c) return i;
    ++i;
  }
  return -1;
}
void shift(vector<int>& ar, int l, int r) {
  int x = ar[r];
  for (int i = l; i < r; i++) {
    ar[i + 1] = ar[i];
  }
  ar[l] = x;
  for (int i = l; i < r; i++) {
    cout << i << " th element : " << ar[i] << "\n";
  }
  cout << "\n";
}
int minimum(long long n) {
  int min = INT_MAX;
  while (n != 0) {
    if (min > n % 10) min = n % 10;
    n /= 10;
  }
  return min;
}
int maximum(long long n) {
  int max = INT_MIN;
  while (n != 0) {
    if (max < n % 10) max = n % 10;
    n /= 10;
  }
  return max;
}
long long isPrime(long long n) {
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return i;
  }
  return -1;
}
int greatesdivisor(int n, int k) {
  int maxi = n;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      maxi = min(maxi, n / i);
    }
  }
  return maxi;
}
int count_one(string s) {
  int ct = 0;
  int i = 0;
  while (s[i] != '\0') {
    if (s[i] == '1') ++ct;
    ++i;
  }
  return ct;
}
int count_zero(string s) {
  int ct = 0;
  int i = 0;
  while (s[i] != '\0') {
    if (s[i] == '0') ++ct;
    ++i;
  }
  return ct;
}
int binary(vector<int> ar, int n, int item) {
  int beg = 0, last = n - 1;
  int mid;
  while (beg <= last) {
    mid = (beg + last) / 2;
    if (item == ar[mid])
      return mid;
    else if (item < ar[mid])
      last = mid - 1;
    else
      beg = mid + 1;
  }
  return last;
}
long long gcd(long long a, long long b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> ar(n);
    for (long long i = 0; i < n; i++) {
      cin >> ar[i];
    }
    bool flag = false;
    long long a, b, c;
    c = -1;
    long long sum = ar[0] + ar[1];
    for (long long i = n - 1; i > 1; i--) {
      if (ar[i] > sum) {
        c = i;
        break;
      }
    }
    if (c == -1) {
      for (long long i = 0; i < n - 1; i++) {
        int j = n - 1;
        int sum = ar[i] + ar[i + 1];
        while (j != 0 && ar[j] != sum) {
          j--;
        }
        if (j != 0) {
          cout << "-1\n";
          return 0;
        }
      }
      cout << 1 << " " << 2 << " " << 3 << "\n";
    } else
      cout << 1 << " " << 2 << " " << c + 1 << "\n";
  }
  return 0;
}
