#include <bits/stdc++.h>
void solve(const std::vector<int>& arr) {
  if (arr.size() < 3) {
    std::cout << "NO" << std::endl;
    return;
  }
  int state = 0;
  int pi = arr[0];
  int pj;
  int i = 1;
  int j, k;
  for (size_t ith = 1; ith < arr.size(); ith++) {
    int x = arr[ith];
    if (state == 0 && x < pi) {
      pi = x;
      i = ith + 1;
    } else if (state == 0 || (state == 1 && x > pj)) {
      state = 1;
      pj = x;
      j = ith + 1;
    } else if (state == 1) {
      state = 2;
      k = ith + 1;
      break;
    }
  }
  if (state == 2) {
    std::cout << "YES" << std::endl;
    std::cout << i << " " << j << " " << k << std::endl;
  } else {
    std::cout << "NO" << std::endl;
  }
}
int main() {
  int n = 0;
  std::cin >> n;
  for (int i = 0; i < n; i++) {
    int nn = 0;
    std::cin >> nn;
    std::vector<int> arr(nn);
    for (int j = 0; j < nn; j++) {
      int x;
      std::cin >> x;
      arr[j] = x;
    }
    solve(arr);
  }
  return 0;
}
