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.util.*;
  // import java.lang.*;
  import java.io.*;
  
  //           THIS TEMPLATE MADE BY AKSH BANSAL.
  
  public class Solution {
      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;
          }
      }
      private static boolean[] isPrime;
      private static void primes(){
          int num = (int)1e6; // PRIMES FROM 1 TO NUM
          isPrime = new boolean[num];
       
          for (int i = 2; i< isPrime.length; i++) {
             isPrime[i] = true;
          }
          for (int i = 2; i< Math.sqrt(num); i++) {
             if(isPrime[i] == true) {
                for(int j = (i*i); j<num; j = j+i) {
                   isPrime[j] = false;
                }
             }
          }
      }
      static void sort(int a[]){ // int -> long
          ArrayList<Integer> arr=new ArrayList<>(); // Integer -> Long
          for(int i=0;i<a.length;i++)
          arr.add(a[i]);
          Collections.sort(arr);
          for(int i=0;i<a.length;i++)
          a[i]=arr.get(i);
          
      }
      private static long gcd(long a, long b){
          if(b==0)return a;
          return gcd(b,a%b);
      }
      private static long pow(long x,long y){
          if(y==0)return 1;
          long temp = pow(x, y/2);
          if(y%2==1){
              return x*temp*temp;
          }
          else{
              return temp*temp;
          }
      }
      // static ArrayList<Integer>[] adj;
      // static void getAdj(int n,int q, FastReader sc){
      //     adj = new ArrayList[n+1];
      //     for(int i=1;i<=n;i++){
      //         adj[i] = new ArrayList<>();
      //     }
      //     for(int i=0;i<q;i++){
      //         int a = sc.nextInt();
      //         int b = sc.nextInt();
  
      //         adj[a].add(b);
      //         adj[b].add(a);
      //     }
      // }
      static PrintWriter out;
      static FastReader sc ;
      public static void main(String[] args) throws IOException {
          sc = new FastReader();
          out = new PrintWriter(System.out);
          // primes();
          // ________________________________
  
          int test = sc.nextInt();
          StringBuilder output = new StringBuilder();
  
          while (test-- > 0) {
              int n = sc.nextInt();
              int k = sc.nextInt();
              int[] arr = new int[n];
              TreeSet<Integer> set = new TreeSet<>();
              for(int i=0;i<n;i++){
                  arr[i] = sc.nextInt();
                  set.add(arr[i]);
              }
              output.append(solver(arr, n, k, set)).append("\n");
          }
  
          out.println(output);
          // _______________________________
  
          // int n = sc.nextInt();
          // out.println(solver());
          // ________________________________
          out.flush();
      }
  
      public static String solver(int[] arr, int n, int k, TreeSet<Integer> set) {
          int cur = 0;
          for(int i=0;i<n-1;i++){
              if(set.higher(arr[i])==null || arr[i+1]!=set.higher(arr[i])){
                  cur++;
              }
          }
          if(cur>=k){
              return "No";
          }
          return "Yes";
      }
  }