#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ll t;
  cin >> t;
  while (t--) {
    ll n;
    cin >> n;
    vector<ll> a(n);
    for (ll i = 0; i < n; i++) {
      cin >> a[i];
    }
    vector<ll> min_before(n, LONG_MAX), min_after(n, LONG_MAX);
    vector<ll> min_before_idx(n, -1), min_after_idx(n, -1);
    for (ll i = 1; i < n; i++) {
      if (a[i - 1] < min_before[i - 1]) {
        min_before[i] = a[i - 1];
        min_before_idx[i] = i - 1;
      } else {
        min_before[i] = min_before[i - 1];
        min_before_idx[i] = min_before_idx[i - 1];
      }
    }
    for (ll i = n - 2; i >= 0; i--) {
      if (a[i + 1] < min_after[i + 1]) {
        min_after[i] = a[i + 1];
        min_after_idx[i] = i + 1;
      } else {
        min_after[i] = min_after[i + 1];
        min_after_idx[i] = min_after_idx[i + 1];
      }
    }
    ll ans_i = -1, ans_j = -1, ans_k = -1;
    for (ll i = 0; i < n - 1; i++) {
      if (min_before[i] < a[i] && min_after[i] < a[i]) {
        ans_i = min_before_idx[i] + 1;
        ans_j = i + 1;
        ans_k = min_after_idx[i] + 1;
        break;
      }
    }
    if (ans_i == -1) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
      cout << ans_i << ' ' << ans_j << ' ' << ans_k << endl;
    }
  }
}
