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: //package com.amoghghadge.compProgramming.Codeforces1000To1300;
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Collections;
  import java.util.HashMap;
  import java.util.Map;
  import java.util.StringTokenizer;
  
  public class MoamenAndKSubarrays {
      
      public static void main(String[] args) {
          
          FastReader in = new FastReader();
          StringBuffer sb = new StringBuffer();
  
          int t = in.nextInt();
  
          while (t > 0) {
  
              int n = in.nextInt(), k = in.nextInt();
              ArrayList<Integer> nums = new ArrayList<Integer>();
              ArrayList<Integer> sorted = new ArrayList<Integer>();
              Map<Integer, Integer> sortPos = new HashMap<Integer, Integer>();
  
              for (int i = 0; i < n; i++) {
  
                  nums.add(in.nextInt());
                  sorted.add(nums.get(i));
  
              }
  
              int count = 1;
  
              Collections.sort(sorted);
  
              for (int i = 0; i < n; i++) {
  
                  sortPos.put(sorted.get(i), i);
  
              }
  
              for (int i = 0; i < n - 1; i++) {
  
                  if (sortPos.get(nums.get(i + 1)) - sortPos.get(nums.get(i)) != 1) {
  
                      count++;
  
                  }
  
              }
  
              if (count > k) {
  
                  sb.append("NO\n");
  
              } else {
  
                  sb.append("YES\n");
  
              }
  
              t--;
  
          }
  
          System.out.println(sb);
          
      }
      
      static int gcd (int a, int b) {
          
          if (b == 0) {
  
              return a;
  
          } else {
  
              return gcd(b, a % b);
  
          }
  
      }
   
      static long gcd (long a, long b) {
          
          if (b == 0) {
  
              return a;
  
          } else {
  
              return gcd(b, a % b);
  
          }
  
      }
   
      static long lcm (int a, int b) {
  
          return (long) a / gcd(a, b) * b;
  
      }
   
      static long lcm (long a, long b) {
  
          return a / gcd(a, b) * b;
  
      }
  
      public static int search (int l, int r, int[] a, int key) {
  
          while (l <= r) {
  
              int middle = ((r - l) / 2) + l;
  
              if (a[middle] == key) {
  
                  return middle;
  
              } else if (a[middle] < key) {
  
                  l = middle + 1;
  
              } else {
  
                  r = middle - 1;
  
              }
  
          }
  
          return -1;
  
      }
  
      public static void sort (int[] a) {
  
  		ArrayList<Integer> l=new ArrayList<>();
  		for (int i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
          
  	}
  
      public static void sort (long[] a) {
  
  		ArrayList<Long> l=new ArrayList<>();
  		for (long i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
  
  	}
  
      public static class FastReader {
  
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st;
  
          public String next() {
  
              while (st == null || !st.hasMoreElements()) {
  
                  try {
  
                      st = new StringTokenizer(br.readLine());
  
                  } catch (IOException e) {
  
                      e.printStackTrace();
  
                  }
  
              }
  
              return st.nextToken();
  
          }
  
          public int nextInt() {
  
              return Integer.parseInt(next());
  
          }
  
          public long nextLong() {
  
              return Long.parseLong(next());
  
          }
  
          public double nextDouble() {
  
              return Double.parseDouble(next());
  
          }
  
          public String nextLine() {
  
              String str = "";
  
              try {
  
                  str = br.readLine();
  
              } catch (IOException e) {
  
                  e.printStackTrace();
  
              }
  
              return str;
  
          }
  
          public int[] readArray(int n) {
  
  			int[] a = new int[n];
  
  			for (int i = 0; i < n; i++) {
                  
                  a[i] = nextInt();
  			
              }
  
              return a;
  
  		}
  
          public long[] readArrayLong(long n) {
  
  			long[] a = new long[(int) n];
  
  			for (int i = 0; i < n; i++) {
                  
                  a[i] = nextLong();
  			
              }
  
              return a;
  
  		}
  
      }
  
  }
  