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.io.*;
  
  public class B_737D2 {
  
      // Snippet for Fast Input-Output
  
      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;
          }
      }
  
      static FastReader sc = new FastReader();
      static PrintWriter out = new PrintWriter(System.out);
  
      static int ni() throws IOException {
          return sc.nextInt();
      }
  
      static long nl() throws IOException {
          return sc.nextLong();
      }
  
      static int[][] nai2(int n, int m) throws IOException {
          int a[][] = new int[n][m];
          for (int i = 0; i < n; i++)
              for (int j = 0; j < m; j++)
                  a[i][j] = ni();
          return a;
      }
  
      static int[] nai(int N, int start) throws IOException {
          int[] A = new int[N + start];
          for (int i = start; i != (N + start); i++) {
              A[i] = ni();
          }
          return A;
      }
  
      static Integer[] naI(int N, int start) throws IOException {
          Integer[] A = new Integer[N + start];
          for (int i = start; i != (N + start); i++) {
              A[i] = ni();
          }
          return A;
      }
  
      static long[] nal(int N) throws IOException {
          long[] A = new long[N];
          for (int i = 0; i != N; i++) {
              A[i] = nl();
          }
          return A;
      }
  
      static void close() {
          out.flush();
      }
  
      // ---------------------Main-Code------------------------------------------
  
      public static void main(String[] args) throws Exception {
          int t = ni();
          while (t-- != 0) {
              int n = ni();
              int k = ni();
              int a[] = nai(n, 0);
              if (k == n) {
                  System.out.println("Yes");
                  continue;
              }
              Pair arr[] = new Pair[n];
              for (int i = 0; i < n; i++) {
                  arr[i] = new Pair(a[i], i);
              }
              Arrays.sort(arr, (x, y) -> Integer.compare(x.val, y.val));
              int count = n;
              int len = 0;
              Integer prev = null;
              for (int i = 0; i < n; i++) {
                  int idx = arr[i].idx;
                  if (prev == null) {
                      prev = idx;
                      continue;
                  }
                  if (idx - prev == 1) {
                      len++;
                      prev = idx;
                  } else {
                      count = count - len;
                      len = 0;
                      prev = idx;
                  }
              }
              count -= len;
              if (count <= k) {
                  System.out.println("Yes");
              } else {
                  System.out.println("No");
              }
  
          }
      }
  
      static class Pair {
          int val;
          int idx;
  
          Pair(int val, int idx) {
              this.val = val;
              this.idx = idx;
          }
      }
  
  }
  