#include <bits/stdc++.h>
template <typename T>
T GCD(T a, T b) {
  return a ? GCD(b % a, a) : b;
}
template <typename T>
T LCM(T a, T b) {
  return (a * b) / GCD(a, b);
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
  for (auto ob : v) os << ob << " ";
  return os;
}
template <typename T, typename S>
std::ostream &operator<<(std::ostream &os, const std::map<T, S> &v) {
  for (auto ob : v) os << ob.first << " : " << ob.second << std::endl;
  return os;
}
using ld = double;
using ll = long long int;
using ul = unsigned long long int;
using namespace std;
class ThreeIndices {
 public:
  void solve(std::istream &in, std::ostream &out) {
    int n;
    in >> n;
    int a[n];
    for (int i = 0; i < n; ++i) {
      in >> a[i];
    }
    for (int i = 1; i < n - 1; ++i) {
      if (a[i] > a[i - 1] && a[i] > a[i + 1]) {
        out << "YES" << endl;
        out << i << ' ' << i + 1 << ' ' << i + 2 << endl;
        return;
      }
    }
    out << "NO" << endl;
  }
};
int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(nullptr);
  ThreeIndices solver;
  std::istream &in(std::cin);
  std::ostream &out(std::cout);
  int n;
  in >> n;
  for (int i = 0; i < n; ++i) {
    solver.solve(in, out);
  }
  return 0;
}
