#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, a[N];
int f[N], u[N];
int ne1[N], ne2[N];
void solve() {
  int n;
  cin >> n;
  memset(f, 0, sizeof f);
  memset(u, 0, sizeof u);
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    f[i] = 1;
    for (int j = 1; j < i; j++)
      if (a[i] > a[j]) {
        f[i] = max(f[i], f[j] + 1);
        ne1[i] = j;
      }
  }
  for (int i = n; i >= 1; i--) {
    u[i] = 0;
    for (int j = n; j > i; j--)
      if (a[i] > a[j]) {
        u[i] = max(u[i], u[j] + 1);
        ne2[i] = j;
      }
  }
  for (int i = 1; i <= n; i++) {
    if (f[i] >= 2 && u[i] >= 1) {
      puts("YES");
      cout << ne1[i] << ' ' << i << ' ' << ne2[i] << endl;
      return;
    }
  }
  puts("NO");
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
