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.BufferedReader;
  import java.io.*;
  import java.util.*;
  
  public class b {
  
      static BufferedReader br;
      static long mod = 1000000000 + 7;
      static HashSet<Integer> p = new HashSet<>();
       static boolean debug =true;
             //  Arrays.sort(time  , (a1,a2) -> (a1[0]-a2[0])); 2d array sort lamda
      public static void main(String[] args) throws Exception {
          br = new BufferedReader(new InputStreamReader(System.in));
          PrintWriter pr = new PrintWriter(System.out);
          int tc = 1;
          tc = cinI();
          while (tc-- > 0) {
                    int[] nk = readArray(2,0,0);
                    int  n=nk[0];int k =nk[1];
               long[] ar=readArray(n,0);
                int cnt=0;
                long[] copy =new long[n];
                HashMap<Long,Integer> indx =new HashMap<>();
               for(int i=0;i<n;i++){
                  copy[i]=ar[i];
                  indx.put(ar[i],i);
               }
  
               copy= sort(copy);
               int last = indx.get(copy[0]);
           //   System.out.println(copy[0]);
               for(int i=1;i<n;i++){
                     int cut = indx.get(copy[i]);
                    // System.out.println(cut +" "+last+" "+copy[i]);
                     if(cut-last!=1){
                        cnt+=1;
       
                     }
                     last= cut;
  
               }
              // System.out.println(cnt);
               if(cnt<k){
                  pr.println("Yes");
               }
               else{
                  pr.println("No");
               }
  
              // System.out.println(cnt+" "+(k-1));
              
          }
          pr.close();
      }
  
      public static <E> void print(String var ,E e){
        if(debug==true){
        System.out.println(var +" "+e);
        }
      }
       private static long[]  sort(long[] e){
       ArrayList<Long> x=new ArrayList<>();
       for(long c:e){
         x.add(c);
       }
       Collections.sort(x);
       long[] y = new long[e.length];
       for(int i=0;i<x.size();i++){
         y[i]=x.get(i);
       }
       return y;
       }
      public static void printDp(long[][] dp) {
  
          int n = dp.length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < dp[0].length; j++) {
                  System.out.print(dp[i][j] + " ");
              }
              System.out.println();
          }
      }
  
      
  
  
    
  
      private static long gcd(long a, long b) {
          if (a == 0)
              return b;
          if (b == 0)
              return a;
  
          // base case
          if (a == b)
              return a;
  
          // a is greater
          if (a > b)
              return gcd(a % b, b);
          return gcd(a, b % a);
      }
  
  
      public static long min(long a, long b) {
          return Math.min(a, b);
      }
  
      public static int min(int a, int b) {
          return Math.min(a, b);
      }
  
  
      public static void sieve() {
          int[] pf = new int[100000000 + 1];
          //0 prime //1 not prime
          pf[0] = 1;
          pf[1] = 1;
          for (int j = 2; j <= 10000; j++) {
  
              if (pf[j] == 0) {
                  p.add(j);
                  for (int k = j * j; k < pf.length; k += j) {
                      pf[k] = 1;
                  }
              }
          }
  
      }
  
  
      public static int[] readArray(int n, int x, int z) throws Exception {
          int[] arr = new int[n];
          String[] ar = cinA();
          for (int i = x; i < n + x; i++) {
              arr[i] = getI(ar[i - x]);
          }
          return arr;
      }
  
      public static long[] readArray(int n, int x) throws Exception {
          long[] arr = new long[n];
          String[] ar = cinA();
          for (int i = x; i < n + x; i++) {
              arr[i] = getL(ar[i - x]);
          }
          return arr;
      }
  
      public static void arrinit(String[] a, long[] b) throws Exception {
          for (int i = 0; i < a.length; i++) {
              b[i] = Long.parseLong(a[i]);
          }
      }
  
      public static HashSet<Integer>[] Graph(int n, int edge, int directed) throws Exception {
          HashSet<Integer>[] tree = new HashSet[n];
  
          for (int j = 0; j < edge; j++) {
  
              String[] uv = cinA();
              int u = getI(uv[0]);
              int v = getI(uv[1]);
              if (directed == 0) {
  
                  tree[v].add(u);
              }
              tree[u].add(v);
          }
          return tree;
      }
  
      public static void arrinit(String[] a, int[] b) throws Exception {
          for (int i = 0; i < a.length; i++) {
              b[i] = Integer.parseInt(a[i]);
          }
      }
  
  
      static double findRoots(int a, int b, int c) {
          // If a is 0, then equation is not
          //quadratic, but linear
  
  
          int d = b * b - 4 * a * c;
          double sqrt_val = Math.sqrt(Math.abs(d));
  
  
          // System.out.println("Roots are real and different \n");
  
          return Math.max((double) (-b + sqrt_val) / (2 * a),
                  (double) (-b - sqrt_val) / (2 * a));
  
  
      }
  
      public static String cin() throws Exception {
          return br.readLine();
      }
  
      public static String[] cinA() throws Exception {
          return br.readLine().split(" ");
      }
  
      public static String[] cinA(int x) throws Exception {
          return br.readLine().split("");
      }
  
      public static String ToString(Long x) {
          return Long.toBinaryString(x);
      }
  
      public static void cout(String s) {
          System.out.println(s);
      }
  
      public static Integer cinI() throws Exception {
          return Integer.parseInt(br.readLine());
      }
  
      public static int getI(String s) throws Exception {
          return Integer.parseInt(s);
      }
  
      public static long getL(String s) throws Exception {
          return Long.parseLong(s);
      }
  
      public static long max(long a, long b) {
          return Math.max(a, b);
      }
  
      public static int max(int a, int b) {
          return Math.max(a, b);
      }
  
      public static void coutI(int x) {
          System.out.println(String.valueOf(x));
      }
  
      public static void coutI(long x) {
          System.out.println(String.valueOf(x));
      }
  
      public static Long cinL() throws Exception {
          return Long.parseLong(br.readLine());
      }
  
      public static void arrInit(String[] arr, int[] arr1) throws Exception {
          for (int i = 0; i < arr.length; i++) {
              arr1[i] = getI(arr[i]);
          }
  
      }
  }