You are given a permutation P1, P2, ... . Pn. 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: .1si Pk. Or say that there are no such indices. Input The first line contains a single integer T ( 1ST