#include <bits/stdc++.h>
using namespace std;
long long modd = 1000 * 1000 * 1000 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cout.precision(17);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, modd);
  int test_cases;
  cin >> test_cases;
  for (int t = (1); t < (1) + (test_cases); ++t) {
    int n;
    cin >> n;
    vector<int> a;
    for (int i = (0); i < (0) + (n); ++i) {
      int aa;
      cin >> aa;
      a.push_back(aa);
    }
    bool found = false;
    for (int i = (1); i < (1) + (n - 2); ++i) {
      if ((a[i - 1] <= a[i]) && (a[i + 1] <= a[i])) {
        cout << "YES" << endl;
        cout << i << " " << i + 1 << " " << i + 2 << endl;
        found = true;
        break;
      }
    }
    if (!found) {
      cout << "NO" << endl;
    }
  }
  return 0;
}
