B'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: 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 neq p_j if i neq j ) -- the permutation p . For each test case: If there are multiple valid triples of indices, print any of them. '...