#include <bits/stdc++.h>
using namespace std;
int findGreater(int compare, int startIndex, int *arr, int sizeofArray) {
  for (int i = startIndex; i < sizeofArray; i++) {
    if (compare < arr[i]) return i;
  }
  return -1;
}
int findLesser(int compare, int startIndex, int *arr, int sizeofArray) {
  for (int i = startIndex; i < sizeofArray; i++) {
    if (compare > arr[i]) return i;
  }
  return -1;
}
void initArray(int *arr, int Size) {
  for (int j = 0; j < Size; j++) {
    cin >> arr[j];
  }
}
int main() {
  int TestCases;
  int Size;
  int *arr;
  int i;
  int j;
  int k;
  cin >> TestCases;
  for (int t = 0; t < TestCases; t++) {
    cin >> Size;
    arr = new int[Size];
    initArray(arr, Size);
    for (int i = 0; i < Size; i++) {
      if (i + 1 == Size) {
        cout << "NO" << endl;
      }
      j = findGreater(arr[i], i + 1, arr, Size);
      if (j < 0) {
        continue;
      }
      k = findLesser(arr[j], j + 1, arr, Size);
      if (k < 0) {
        continue;
      }
      cout << "YES" << endl;
      cout << i + 1 << " " << j + 1 << " " << k + 1 << endl;
      break;
    }
  }
}
