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
import javax.print.DocFlavor;
import javax.print.attribute.HashAttributeSet;
import java.awt.event.MouseAdapter;
import java.io.*;

import java.math.BigInteger;
import java.nio.channels.FileChannel;
import java.util.*;

import java.util.ArrayList;

import java.util.Scanner;


public class adaking {

    static class pair {
        int first;
        int second;

        pair(int a, int b) {
            first = a;
            second = b;
        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static final int mod = 1000000007;

    public static int gcd(int a, int b) {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }
    public static String findSubString(String str, String pat)
    {
        int len1 = str.length();
        int len2 = pat.length();

        // check if string's length is less than pattern's
        // length. If yes then no such window can exist
        if (len1 < len2)
        {
            System.out.println("No such window exists");
            return "";
        }

        int hash_pat[] = new int[256];
        int hash_str[] = new int[256];

        // store occurrence ofs characters of pattern
        for (int i = 0; i < len2; i++)
            hash_pat[pat.charAt(i)]++;

        int start = 0, start_index = -1, min_len = Integer.MAX_VALUE;

        // start traversing the string
        int count = 0; // count of characters
        for (int j = 0; j < len1 ; j++)
        {
            // count occurrence of characters of string
            hash_str[str.charAt(j)]++;

            // If string's char matches with pattern's char
            // then increment count
            if (hash_pat[str.charAt(j)] != 0 &&
                    hash_str[str.charAt(j)] <= hash_pat[str.charAt(j)] )
                count++;

            // if all the characters are matched
            if (count == len2)
            {
                // Try to minimize the window i.e., check if
                // any character is occurring more no. of times
                // than its occurrence in pattern, if yes
                // then remove it from starting and also remove
                // the useless characters.
                while ( hash_str[str.charAt(start)] > hash_pat[str.charAt(start)]
                        || hash_pat[str.charAt(start)] == 0)
                {

                    if (hash_str[str.charAt(start)] > hash_pat[str.charAt(start)])
                        hash_str[str.charAt(start)]--;
                    start++;
                }

                // update window size
                int len_window = j - start + 1;
                if (min_len > len_window)
                {
                    min_len = len_window;
                    start_index = start;
                }
            }
        }

        // If no window found
        if (start_index == -1)
        {
            System.out.println("No such window exists");
            return "";
        }

        // Return substring starting from start_index
        // and length min_len
        return str.substring(start_index, start_index + min_len);
    }
    public static void primeFactors(long n)
    {
        // Print the number of 2s that divide n
        long ans=0;
        long m=n;
        while (n%2==0)
        {
            //System.out.print(2 + " ");
            ans=2;
            n /= 2;
        }

        // n must be odd at this point.  So we can
        // skip one element (Note i = i +2)
        for (int i = 3; i <= Math.sqrt(n); i+= 2)
        {
            // While i divides n, print i and divide n
            while (n%i == 0)
            {
               // System.out.print(i + " ");
                ans=i;
                n /= i;
            }
        }

        // This condition is to handle the case whien
        // n is a prime number greater than 2
        //System.out.println(ans);
        if (n > 2)
        {
            //System.out.print(n);
            ans=n;

        }
        if(ans==m)
            System.out.println(1+" "+(ans-1));
        else
        System.out.println(ans+" "+(m-ans));

    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        sc.nextLine();

        for (int k = 0; k < t; k++) {
            int fla=0;
            int n=sc.nextInt();
            int a[]=new int [n];
            for(int j=0;j<n;j++)
                a[j]=sc.nextInt();
            for(int i=0;i<n;i++)
            {
                int f=0;
                int x=a[i];
                int in=-1;
                for(int j=i+1;j<n;j++)
                {
                    if(a[j]>x)
                    {
                        f=1;
                        in =j;
                        break;
                    }

                }

                if(f==1)
                {
                    int fl=0;
                    int ind=-1;
                    for(int j=in+1;j<n;j++)
                    {
                        if(a[j]<a[in])
                        {
                            fl=1;
                            ind =j;
                        }
                    }
                    if(fl==1)
                    {
                        System.out.println("YES");
                        System.out.println((i+1)+" "+(in+1)+" "+(ind+1));
                        fla=1;
                        break;
                    }
                }


            }
            if(fla==0)
            System.out.println("NO");

        }
    }
}




















