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: import java.io.*;
  import java.util.*;
  public class Codeforces1 {
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader(){
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String next(){
              while(st == null || !st.hasMoreElements()){
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt(){return Integer.parseInt(next());}
  
          long nextLong(){return Long.parseLong(next());}
  
          double nextDouble(){return Double.parseDouble(next());}
  
          String nextLine(){
              String str = "";
              try {
                  str=br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      
      public static void main(String[] args)throws IOException {
          FastReader sc = new FastReader();
          BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
          //t -> test cases;
          long t = sc.nextLong();
          while(t-->0){
              int n = sc.nextInt();
              int k = sc.nextInt();
              long arr[] = new long[n];
              Map<Long, Integer> index = new LinkedHashMap<>();
          
              int changes = 0;
              for(int i=0; i<n; i++){
                  arr[i]=sc.nextLong();
                  index.put(arr[i], i);
              }
              Arrays.sort(arr);
              for(int i=0; i<n-1; i++){
                  int i1 = index.get(arr[i]);
                  int i2 = index.get(arr[i+1]);
                  if(i2-i1 != 1){
                      changes++;
                  }
              }
              if(k == n){
                  output.write("YES"+"\n");
              }
              else if(k > changes){
                  output.write("YES"+"\n");
              }else{
                  output.write("NO"+"\n");
              }
              
          }
          output.flush();
      }
      //Number of bits
      static int numberOfBits(int n){
          return (int)(Math.log(n)/Math.log(2)+1);
      }
      
      //GCD of a Two number
      static long GCD(long a, long b){
          if(b==0)
          return a;
          return GCD(b, a%b);
      }
  
      //No of factors in factorial n i.e. (n!)
      static long factors(long n, long b){
          long count =0;
          int power = 1;
          while(n>=b){
              count+=n/b;
              b=(long)Math.pow(b, ++power);
          }
          return count;
      }
      static boolean[] primeUptoN(int n){
          boolean arr[]= new boolean[n];
          
          return arr;
      }
  }
  