description: Moamen has an array of n 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 k 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 a is a subarray of a sequence b if a can be obtained from b 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
  
  The first line contains a single integer t (1 ≤ t ≤ 10^3) — the number of test cases. The description of the test cases follows.
  
  The first line of each test case contains two integers n and k (1 ≤ k ≤ n ≤ 10^5).
  
  The second line contains n integers a_1, a_2, …, a_n (0 ≤ |a_i| ≤ 10^9). It is guaranteed that all numbers are distinct.
  
  It is guaranteed that the sum of n over all test cases does not exceed 3⋅10^5.
  
  Output
  
  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
  
  Input
  
  
  3
  5 4
  6 3 4 2 1
  4 2
  1 -4 0 -2
  5 1
  1 2 3 4 5
  
  
  Output
  
  
  Yes
  No
  Yes
  
  Note
  
  In the first test case, a = [6, 3, 4, 2, 1], and k = 4, so we can do the operations as follows: 
  
    1. Split a into \{ [6], [3, 4], [2], [1] \}. 
    2. Reorder them: \{ [1], [2], [3,4], [6] \}. 
    3. Merge them: [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 2 subarrays.
  
  As an example, if we split it into \{ [1, -4], [0, -2] \}, we can reorder them into \{ [1, -4], [0, -2] \} or \{ [0, -2], [1, -4] \}. However, after merging the subarrays, it is impossible to get a sorted array.
solution: #include <bits/stdc++.h>
  using namespace std;
  long long power(long long x, long long y) {
    if (y == 0)
      return 1;
    else {
      long long result = power(x, y / 2) % 1000000007;
      if (y % 2 == 0)
        return (result % 1000000007 * result % 1000000007) % 1000000007;
      else
        return (result % 1000000007 * result % 1000000007 * x % 1000000007) %
               1000000007;
    }
  }
  long long gcd(long long a, long long b) {
    if (b == 0)
      return a;
    else
      return gcd(b, a % b);
  }
  long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
  void solve() {
    long long n, k;
    cin >> n >> k;
    vector<long long> v(n);
    vector<long long> vs(n);
    for (long long i = 0; i < n; i++) {
      cin >> v[i];
      vs[i] = v[i];
    }
    if (n == k) {
      cout << "YES"
           << "\n";
      return;
    }
    sort(vs.begin(), vs.end());
    map<long long, long long> m;
    for (long long i = 0; i < n; i++) {
      m[vs[i]] = i;
    }
    long long c = 0;
    for (long long i = 0; i < n - 1; i++) {
      long long ele = v[i];
      if (v[i + 1] != vs[m[ele] + 1]) c++;
    }
    if (c + 1 > k)
      cout << "NO"
           << "\n";
    else
      cout << "YES"
           << "\n";
  }
  int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long t;
    cin >> t;
    while (t--) {
      solve();
    }
    return 0;
  }
  