You are given a permutation p_1, p_2, ..., p_n. Recall that sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.

Find three indices i, j and k such that: 

  * 1 ≤ i < j < k ≤ n; 
  * p_i < p_j and p_j > p_k. 

Or say that there are no such indices.

Input

The first line contains a single integer T (1 ≤ T ≤ 200) — the number of test cases.

Next 2T lines contain test cases — two lines per test case. The first line of each test case contains the single integer n (3 ≤ n ≤ 1000) — the length of the permutation p.

The second line contains n integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ n; p_i ≠ p_j if i ≠ j) — the permutation p.

Output

For each test case: 

  * if there are such indices i, j and k, print YES (case insensitive) and the indices themselves; 
  * if there are no such indices, print NO (case insensitive). 



If there are multiple valid triples of indices, print any of them.

Example

Input


3
4
2 1 4 3
6
4 6 1 2 5 3
5
5 3 1 2 4


Output


YES
2 3 4
YES
3 5 6
NO
//https://codeforces.com/problemset/problem/1380/A

import java.util.*;

public class three_indices {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();

        int[][] final_answers = new int[T][];

        for (int i = 0; i < T; i++) {

            int n = scanner.nextInt();
            int[] p = new int[n];

            for (int j = 0; j < n; j++) {
                p[j] = scanner.nextInt();
            }

            final_answers[i] = machine(p);
        }

        final_print(final_answers);

    }

    public static int[] machine(int[] p) {

        int[] answers = new int[3];

        for (int i = 1 ; i < p.length - 1; i++) {

            answers[1] = i +1;

            for (int j = 0; j < i; j++) {
                if (p[j] < p[i]) {
                    answers[0] = j + 1;
                    break;
                } else {
                    answers[0] = -1;
                }
            }

            for (int k = p.length - 1; k > i; k--) {
                if (p[k] < p[i]) {
                    answers[2] = k + 1;
                    break;
                } else {
                    answers[2] = -1;
                }
            }

            if (answers[0] > 0 && answers[1] > 0 && answers[2] > 0) {
                break;
            }

        }

        return answers;
    }

    public static void final_print(int[][] final_answers) {

        String[] str = new String[final_answers.length];

        for (int i = 0; i < final_answers.length; i++) {
            for (int j = 0; j < final_answers[i].length; j++) {
                if (final_answers[i][j] == -1) {
                    str[i] = "NO";
                    break;
                } else {
                    str[i] = "YES";
                }
            }
        }

        for (int k = 0; k < final_answers.length; k++) {
            System.out.println(str[k]);
            for (int l = 0; l < final_answers[k].length; l++) {
                if (str[k].equals("NO")) {
                    break;
                } else {
                    System.out.print(final_answers[k][l] + " ");
                }
            }
            System.out.println();
        }
        

    }







}


















