#include <bits/stdc++.h>
using namespace std;
int n;
int a[50005];
void enter() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
}
void solve() {
  enter();
  for (int i = 2; i <= n - 1; i++) {
    int v = a[i];
    int u = min_element(a + 1, a + i) - a;
    int w = min_element(a + i + 1, a + n + 1) - a;
    if (a[u] < v && v > a[w]) {
      printf("YES\n%d %d %d\n", u, i, w);
      return;
    }
  }
  printf("NO\n");
}
int main() {
  int t = 1;
  scanf("%d ", &t);
  while (t-- > 0) solve();
}
