Hemose Shopping

Description:

Input:

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ $$$(1 \leq t \leq 10^5)$$$. Description of the test cases follows.

The first line of each test case contains two integers $$$n$$$ and $$$x$$$ $$$(1 \leq x \leq n \leq 10^5)$$$.

The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, ..., a_n$$$ $$$(1 \leq a_i \leq 10^9)$$$.

It is guaranteed that the sum of $$$n$$$ over all test cases doesn't exceed $$$2 \cdot 10^5$$$.

Output:

For each test case, you should output a single string.

If Samez can sort the array in non-decreasing order using the operation written above, output "YES" (without quotes). Otherwise, output "NO" (without quotes).

You can print each letter of "YES" and "NO" in any case (upper or lower).

Sample Input:

4
3 3
3 2 1
4 3
1 2 3 4
5 2
5 1 2 3 4
5 4
1 2 3 4 4

Sample Output:

NO
YES
YES
YES

Note:

In the first test case, you can't do any operations.

In the second test case, the array is already sorted.

In the third test case, you can do the operations as follows:

• $$$[5,1,2,3,4]$$$, $$$swap(a_1,a_3)$$$
• $$$[2,1,5,3,4]$$$, $$$swap(a_2,a_5)$$$
• $$$[2,4,5,3,1]$$$, $$$swap(a_2,a_4)$$$
• $$$[2,3,5,4,1]$$$, $$$swap(a_1,a_5)$$$
• $$$[1,3,5,4,2]$$$, $$$swap(a_2,a_5)$$$
• $$$[1,2,5,4,3]$$$, $$$swap(a_3,a_5)$$$
• $$$[1,2,3,4,5]$$$

(Here $$$swap(a_i, a_j)$$$ refers to swapping elements at positions $$$i$$$, $$$j$$$).