Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo's path to escape from the museum. But Kiddo didn't want to give it back. So, Kiddo asked Conan a question. If Conan could give a right answer, Kiddo would return the ring to the museum.

Kiddo: "I have an array $A$ and a number $k$, if you can choose exactly $k$ elements from $A$ and erase them, then the remaining array is in non-increasing order or non-decreasing order, we say $A$ is a magic array. Now I want you to tell me whether $A$ is a magic array. " Conan: "emmmmm..." Now, Conan seems to be in trouble, can you help him?

Kiddo: "I have an array $A$ and a number $k$, if you can choose exactly $k$ elements from $A$ and erase them, then the remaining array is in non-increasing order or non-decreasing order, we say $A$ is a magic array. Now I want you to tell me whether $A$ is a magic array. " Conan: "emmmmm..." Now, Conan seems to be in trouble, can you help him?

The first line contains an integer T indicating the total number of test cases. Each test case starts with two integers $n$ and $k$ in one line, then one line with $n$ integers: $A_1,A_2\dots A_n$.

$1\leq T\leq 20$

$1\leq n\leq 10^5$

$0\leq k\leq n$

$1\leq A_i\leq 10^5$

$1\leq T\leq 20$

$1\leq n\leq 10^5$

$0\leq k\leq n$

$1\leq A_i\leq 10^5$

提交代码