#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  if (n <= 2) {
    cout << "NO" << endl;
    return;
  }
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<bool> left(n, false);
  vector<bool> right(n, false);
  int leftmin = a[0];
  for (int i = 1; i < n; i++) {
    if (a[i] > leftmin) {
      left[i] = true;
    } else {
      leftmin = a[i];
    }
  }
  int rightmin = a[n - 1];
  for (int i = n - 2; i >= 0; i--) {
    if (a[i] > rightmin) {
      right[i] = true;
    } else {
      rightmin = a[i];
    }
  }
  int need = -1;
  for (int i = 0; i < n; i++) {
    if (left[i] && right[i]) {
      need = i;
      break;
    }
  }
  if (need == -1) {
    cout << "NO" << endl;
    return;
  }
  cout << "YES" << endl;
  int start = 0;
  int end = 0;
  for (int i = need - 1; i >= 0; i--) {
    if (a[i] < a[need]) {
      start = i;
      break;
    }
  }
  for (int i = need + 1; i < n; i++) {
    if (a[i] < a[need]) {
      end = i;
      break;
    }
  }
  cout << start + 1 << " " << need + 1 << " " << end + 1 << endl;
}
int main() {
  int t;
  cin >> t;
  while (t-- > 0) {
    solve();
  }
  return 0;
}
