Minimum or Maximum

From a hidden array $A$ of length $N$, Stack constructs an array $B$ of length $N$ such that: - For all $i$ $(1 \leq i \leq N)$, $B_i=\max(A_1,A_2,\ldots,A_i)$ **or** $B_i=\min(A_1,A_2,\ldots,A_i)$. For the given array $B$ of length $N$, Stack wants you to check whether a possible array $A$ exists or not. ### Input - The first line of input contains a single integer $T$, denoting the number of t