This is the easy version of the problem. The only difference between the easy and hard versions is that the hard version asks you to construct an example of a satisfactory tree. As an Earth mage, Rae has mastered the spell of growing trees! But Manaria brags that she can grow a more impressive species of trees. Rae remembers that the most rare type of tree can be grown using a formula represented by a certain permutation — please help her construct it! You are given a permutation(^{\text{∗}}) (p) of length (n). Determine if there exists an undirected tree with (n) vertices labeled (1, 2, \dots, n), satisfying the following condition: Let (u) and (v) ((1\leq {\color{red}{u < v}} \leq n)) be any two vertices connected by an edge. Then (u) appears before (v) in (p). (^{\text{∗}})A permutation of length (n) is an array that contains every integer from (1) to (n) exactly once, in any order. The first line contains a single integer (t) ((1 \leq t \leq 10^4)) — the number of test cases. The first line of each test case contains a single integer (n) ((2\leq n\leq 2\cdot 10^5)). The second line of each test case contains (n) integers, (p_1, p_2, \dots, p_n) ((1\leq p_i\leq n)). It is guaranteed that all (p_i) are distinct. It is guaranteed that the sum of (n) over all test cases does not exceed (2\cdot 10^5). For each test case, output on a single line " Yes " if there exists a tree satisfying the given condition, and " No " otherwise. You may output the answer in any case (upper or lower). For example, the strings " yEs ", " yes ", " YES ", and " yeS " will be recognized as " Yes ". In the first example, we can construct the tree with the following edges: (\{3, 1\}), (\{4, 1\}), (\{6, 5\}), (\{6, 2\}), (\{6, 1\}). Then we have that (1 < 3), and (1) appears before (3) in (p), (1 < 4), and (1) appears before (4) in $$$p$