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
"""c='H'
thickness=2
#Top Cone
for i in range(thickness):
    print((c*i).rjust(thickness-1)+c+(c*i).ljust(thickness-1))"""
"""
print(''.rjust(2)+'9')
print((('o')*1).rjust(4)+'0'+(('p')*1).center(2))"""
"""str1='thanks'
print(str1.swapcase())
list1= list(str1)
str2: str=str(list1[::-1])
print(str2)
"""

"""print(bin(5))
print((str(hex(15)).replace('0x','')).upper())
i=5
print(str(i).rjust(1)+str(oct(i)).replace('0o','').rjust(1)+(str(hex(i)).replace('0x','')).upper().rjust(1)+str(bin(i).replace('0b','')))
list1=([str(i),str(oct(i)).replace('0o','')],str(hex(i)).replace('0x','').upper(),str(bin(i).replace('0b',''))])"""
"""size=3
n = (((size - 1) * 2) * 2) + 1
alp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
       'w', 'x', 'y', 'z']
print(alp[2].center(n, '-'), sep='-', end='')
print()"""
"""import string

size=3
width = 4 * size - 3
alpha = string.ascii_lowercase
for i in list(range(size))[::-1] + list(range(1, size)):
        print('-'.join(alpha[size-1:i:-1] + alpha[i:size]).center(width, '-'))"""
"""size =5
n = (((size - 1) * 2) * 2) + 1
alp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
       'w', 'x', 'y', 'z']
p = []
s = ''

n = (((size - 1) * 2) * 2) + 1
alp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
       'w', 'x', 'y', 'z']
p = []
s = ''

for i in range(size - 1, -1, -1):
    s = '-'.join(alp[i:size])
    if (len(s) >= 3):
        s = '-'.join(s[len(s) - 3::-2])+'-'+s[::-1]
    p.append(s)


for i in range(len(p)):
    print(p[i].center(n,'-'))
for i in range(len(p)-2,-1,-1):
    print(p[i].center(n, '-'))"""
v='1hivam kumar'.split(' ')
"""v1=list(v[0])
v1[0]=str(v1[0]).upper()
v[0]=''.join(v1[0:])
print(v)
vowel=['a','e','i','o','u']
print('s' in vowel)"""

"""n =int(input())
tc=[]
for i in range (n):
    inp=int(input())
    tc.append(inp)
sol=[]
for i in tc:

    sum=3
    for s in range(i):
        if(i%sum==0):
            sol.append(i//sum)
            break
        sum=sum+2**(s+2)





for s in sol:
    print(s)
"""

"""#!/bin/python3

import math
import os
import random
import re
import sys
from collections import Counter
import heapq


if __name__ == '__main__':
    s = input()
    l1=list(s)
    counter = Counter(l1)
    t = counter.most_common(len(s))
    f=[]
    for i in range(3):
        f.append('')


    f[0]=t[0]
    f[1]=t[1]
    f[2]=t[2]






    for i in range(len(t)):
        for j in range(len(t)):
            if(t[i][1]==t[j][1] and ord(t[i][0])< ord(t[j][0])):

                t[i],t[j]=t[j],t[i]

    for i in range(3):

        print(ord(t[i][0]))
        print(t[i][0],t[i][1])
"""
"""try:
 t=int(input())
 for _ in range(t):
     ot=list(map(int,input().split()))
     tt=list(map(int,input().split()))
     dt=ot-tt
     print(dt)


except:
 pass"""


"""try:
  for _ in range(int(input())):
    n=int(input())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    a.sort()
    pa=0
    at=1
    la=[]
    b.sort()
    pb=0
    bt=1
    lb=[]

    for i in range(1,n):
        if(a[i]==a[pa]):
            at=at+1
        elif(a[i]!=a[pa]):
            la.append([pa,at])
            pa=i
            at=1
        if(b[i]==b[pb]):
            bt=bt+1
        elif(b[i]!=b[pb]):
            lb.append([pb,bt])
            pb=i
            bt=1
    la.append([pa,at])
    lb.append([pb,bt])
    c=0
    fa=[]
    fb=[]
    if (len(la) == len(lb)):
        for i in range(len(a)):
            if(la[i][0]==lb[i][0] and (la[i][1]+lb[i][1])%2==0 and(la[i][1]!=lb[i][1])):
                fa.append([la[i][0],la[i][1]])
                fb.append([la[i][0],la[i][1]])
            if(la[i][0]==lb[i][0] and (la[i][1]+lb[i][1])%2!=0):
                print(-1)
                l=-1
                break
            if(la[i][0]!=lb[i][0] and ((la[i][1])%2==0 and (lb[i][1])%2==0)):
                fa.append([la[i][0], la[i][1]])
                fb.append([la[i][0], la[i][1]])
            if(la[i][0]!=lb[i][0] and ((la[i][1])%2!=0 or (lb[i][1])%2!=0)):
                print(-1)
                l=-1
                break
        if(l!=-1):
            i=0
            j = len(fb)
            while(len(fa)!=0):

                if((fa[i][1]+fb[j-1][1])%2==0):
                    c=c+(fa[i][0])*abs(fa[i][1]-fb[j-1][1])
                    fa.pop(i)
                    fb.pop(j-1)
                    j=len(a)
                else:
                    j=j-1




    else:
        print(-1)

    print(c)










except:"""

for _  in range(int(input())):
    n=int(input())
    p=list(map(int,input().split()))
    x=0
    y=0
    z=0
    c=0
    r=n
    b=n

    while(True):
        if(b!=p[c] and b!=p[r-1]):

            for i in range(c,r-1):
                if(b==p[i]):
                    x=i
                    y=i+1
                    z=i+2
                    break
        if(b==p[c]):


            c=c+1
            b=b-1


        if(b==p[r-1]):

            r=r-1

            b=b-1
        if(x!=0 and y!=0 and z!=0):
            print('YES')
            print(x,y,z)
            break
        if(r-c<2):
            print('NO')
            break





