You are given a permutation $p_1, p_2, \dots, 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 \le i < j < k \le 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 \le T \le 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 \le n \le 1000$) — the length of the permutation $p$.

The second line contains $n$ integers $p_1, p_2, \dots, p_n$ ($1 \le p_i \le n$; $p_i \neq p_j$ if $i \neq 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

Starter code:

Solutions:
import sys
import math
#from queue import *
import random
#sys.setrecursionlimit(int(1e6))
input = sys.stdin.readline
 
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
    return(int(input()))
def inara():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(list(map(int,input().split())))
################################################################
############ ---- THE ACTUAL CODE STARTS BELOW ---- ############

t=inp()

for _ in range(t):
	n=inp()
	ara=inara()
	
	ans=[]
	
	for i in range(1,n-1):
		if ara[i]>ara[i-1] and ara[i]>ara[i+1]:
			ans.append(i)
			ans.append(i+1)
			ans.append(i+2)
			break
	
	if len(ans)==0:
		print("NO")
	else:
		print("YES")
		print(*ans)
	
	
			


for _ in range(int(input())):
    N=int(input())
    A=list(map(int,input().split()))
    temp=0
    for i in range(1,N-1):
        if(A[i]>A[i-1] and A[i]>A[i+1]):
            temp=1
            print("YES")
            print(i,i+1,i+2)
            break
    if(temp==0):
        print("NO")

T = int(input())
for _ in range(T):
    n = int(input())
    ls = list(map(int, input().split()))
    ans = 'NO'
    for i in range(1, n -1):
        if ls[i] > ls[i-1] and ls[i] > ls[i+1]:
            ans = 'YES'
            break
    if ans == 'NO':
        print(ans)
    else:
        i += 1
        print(ans)
        print(i-1, i, i+1)

import sys
# from collections import defaultdict
# t=1
t=int(input())
for i in range(t):
    n=int(input())
    a=list(map(int,sys.stdin.readline().strip().split()))
    # a,b,c,d=list(sys.stdin.readline().strip().split())
    # n,k=list(map(int,sys.stdin.readline().strip().split()))
    
    x1=[]
    x2=[]
    
    x=a[0]
    mni=0
    for j in range(n):
       if(a[j]<x):
           x=a[j]
           mni=j
       x1.append([x,mni])
    
    x=a[n-1]
    mni=n-1
    for j in range(n-1,-1,-1):
        if(a[j]<x):
            x=a[j]
            mni=j
        x2.append([x,mni])
        
    f=0
    for j in range(1,n-1):
        if(x1[j-1][0]<a[j] and a[j]>x2[n-j-1][0]):
            print("YES")
            print(x1[j-1][1]+1,j+1,x2[n-j-1][1]+1)
            f=1
            break
    if(f):
        continue
    print("NO")


for _ in range(int(input())):
    n = int(input())
    p = list(map(int, input().split()))
    for i in range(1, n - 1):
        if p[i] > p[i - 1] and p[i] > p[i + 1]:
            print("YES")
            print(i, i + 1, i + 2)
            break
    else:
        print("NO")

for _ in range(int(input())):
	n=int(input())
	a=list(map(int,input().split()))
	#n,k=map(int,input().split())
	yes=0 
	for i in range(1,n-1):
		if(a[i]>a[i-1] and a[i]>a[i+1]):
			print('YES')
			print(i-1+1,i+1,i+2)
			yes=1
			break 
	if(yes==0):
		print('NO')

def main():
	# n ,m= map(int,input().split())
	# arr = list(map(int,input().split()))
	# b = list(map(int,input().split()))
	# n = int(input())
	# string = str(input())
	# a = list(map(int,input().split()))	
	n = int(input())
	a = list(map(int,input().split()))
	for i in range(n-2):
		if a[i]<a[i+1] and a[i+1]>a[i+2]:
			print("YES")
			print(i+1,i+2,i+3)
			return
	print("NO")
	
	
# main()
def test():
	t = int(input())
	while t:
		main()
		t-=1
test()


for kek in range(int(input())):
    n = int(input())
    p = list(map(int, input().split()))
    flag = False
    ans = 0
    for i in range(1, n-1):

        if p[i-1] < p[i] and p[i] > p[i+1]:
            flag = True
            ans = i + 1
            break

    if flag:
        print('YES')
        print(ans-1,ans,ans+1)
    else:
        print('NO')


t = int(input())

for _ in range(t):
    n = int(input())
    A = [int(x) for x in input().split()]
    for i in range(1,n-1):
        if A[i-1] < A[i] and A[i] > A[i+1]:
            print('YES')
            print(i, i+1, i+2)
            break
    else:
        print('NO')



from math import *
t=int(input())
for _ in range(t):
    n=int(input())
    a=list(map(int,input().split()))
    for i in range(1,n-1):
        if a[i]>a[i-1] and a[i]>a[i+1]:
            print('YES')
            print(i,i+1,i+2)
            break
    else:
        print('NO')


t = int(input())

for _ in range(t):
    n = int(input())
    A = [int(x) for x in input().split()]
    for i in range(1,n-1):
        if A[i-1] < A[i] and A[i] > A[i+1]:
            print('YES')
            print(i, i+1, i+2)
            break
    else:
        print('NO')



from sys import stdin, stdout
import math,sys
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import bisect as bi
import heapq 
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')): 
    #------------------Sublime--------------------------------------#
    sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
    def I():return (int(input()))
    def In():return(list(map(int,input().split())))
else:
    #------------------PYPY FAst I/o--------------------------------#
    def I():return (int(stdin.readline()))
    def In():return(list(map(int,stdin.readline().split())))

def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d

def main():
    try:
        n=I()
        l=list(In())
        ans=-1
        for x in range(1,n-1):
            if l[x-1]<l[x] and l[x]>l[x+1]:
                ans=x
                break
        if ans==-1:
            no()
        else:
            yes()
            print(ans,ans+1,ans+2)

    except:
        pass
        
M = 998244353
P = 1000000007
 
def __starting_point():
    for _ in range(I()):main()
    #for _ in range(1):main()

__starting_point()