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 Main {
      static class Scanner{
          BufferedReader br ;
          StringTokenizer st;
          Scanner(){
              br = new BufferedReader(new InputStreamReader(System.in));
              st = new StringTokenizer("");
          }
          String next() throws IOException {
              while(!st.hasMoreElements()){
                  st = new StringTokenizer(br.readLine());
              }
              return st.nextToken();
          }
          String nextLine() throws IOException{
              return br.readLine();
          }
          int nextInt() throws  IOException{
              return Integer.parseInt((next()));
          }
          boolean isReady() throws IOException {
              return br.ready();
          }
      }
      static PrintWriter pw = new PrintWriter(System.out);
      public static final int inf =(int)2e9;
      public static int gcd(int x,int y){
          if(x==0||y==0)return 0;
          while (x!=y){
              if(x>y){
                  x-=y;
              }
              else y-=x;
          }
          return x;
      }
  
      public static class pair implements Comparable<pair>{
          int u,v;
          public pair(int u,int v) {
              this.u = u;
              this.v = v;
          }
  
          @Override
          public String toString() {
              return "("+u+" "+v+")";
          }
  
          @Override
          public int compareTo(pair o) {
              return u - o.u;
          }
      }
      public static void main(String[] args) throws IOException, InterruptedException {
          Scanner sc = new Scanner();
          int t = sc.nextInt();
          while(t-->0){
              int n= sc.nextInt();
              int k = sc.nextInt();
              pair[] arr = new pair[n];
              for(int i =0;i<n;i++){
                  arr[i] = new pair(sc.nextInt(),i);
              }
              Arrays.sort(arr);
              int count =0;
              for(int i=0;i<arr.length;i++){
                  for(int j = i;j<arr.length;j++){
                      if(j!=0&&arr[j-1].v!=arr[j].v-1){
                          count++;
                          i = j;
                          break;
                      }
                  }
              }
              if(count<k){
                  pw.println("YES");
              }
              else pw.println("No");
          }
          pw.close();
      }
  }
  
  