#include <bits/stdc++.h>
using namespace std;
struct node {
  int num, id;
};
node a[1005];
bool cmp(node a, node b) { return a.num > b.num; }
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout.setf(ios::fixed), cout.precision(0);
  srand((unsigned)time(NULL));
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
      cin >> a[i].num;
      a[i].id = i + 1;
    }
    sort(a, a + n, cmp);
    int flag = 1;
    for (int i = 0; i < n - 2; ++i) {
      int f1 = 0, f2 = 0;
      for (int j = i + 1; j < n; ++j) {
        if (a[j].id > a[i].id)
          f1 = a[j].id;
        else
          f2 = a[j].id;
        if (f1 && f2) break;
      }
      if (f1 && f2) {
        cout << "YES"
             << "\n"
             << min(f1, f2) << " " << a[i].id << " " << max(f1, f2) << "\n";
        flag = 0;
        break;
      }
    }
    if (flag)
      cout << "NO"
           << "\n";
  }
}
