• # For Solution

Moamen has an array of nn distinct integers. He wants to sort that array in non-decreasing order by doing the following operations in order exactly once:

1. Split the array into exactly kk non-empty subarrays such that each element belongs to exactly one subarray.
2. Reorder these subarrays arbitrary.
3. Merge the subarrays in their new order.

A sequence aa is a subarray of a sequence bb if aa can be obtained from bb by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

Can you tell Moamen if there is a way to sort the array in non-decreasing order using the operations written above?

Input Moamen and k-subarrays solution codeforces

The first line contains a single integer tt (1t1031≤t≤103) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers nn and kk (1kn1051≤k≤n≤105).

The second line contains nn integers a1,a2,,ana1,a2,…,an (0|ai|1090≤|ai|≤109). It is guaranteed that all numbers are distinct.

It is guaranteed that the sum of nn over all test cases does not exceed 31053⋅105.

Output  Moamen and k-subarrays solution codeforces

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

If Moamen can sort the array in non-decreasing order, output “YES” (without quotes). Otherwise, output “NO” (without quotes).

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

Example  Moamen and k-subarrays solution codeforces
input

Copy
3
5 4
6 3 4 2 1
4 2
1 -4 0 -2
5 1
1 2 3 4 5

output

Copy
Yes
No
Yes

Note  Moamen and k-subarrays solution codeforces

In the first test case, a=[6,3,4,2,1]a=[6,3,4,2,1], and k=4k=4, so we can do the operations as follows:

1. Split aa into {,[3,4],,}{,[3,4],,}.
2. Reorder them: {,,[3,4],}{,,[3,4],}.
3. Merge them: [1,2,3,4,6][1,2,3,4,6], so now the array is sorted.

In the second test case, there is no way to sort the array by splitting it into only 22 subarrays.

As an example, if we split it into {[1,4],[0,2]}{[1,−4],[0,−2]}, we can reorder them into {[1,4],[0,2]}{[1,−4],[0,−2]} or {[0,2],[1,4]}{[0,−2],[1,−4]}. However, after merging the subarrays, it is impossible to get a sorted array.

• # For Solution

 Ezzat and Two Subsequences standard input/output 1 s, 256 MB B Moamen and k-subarrays standard input/output 2 s, 256 MB C Moamen and XOR standard input/output 2 s, 256 MB D Ezzat and Grid standard input/output 2.5 s, 256 MB E Assiut Chess standard input/output 1 s, 256 MB 