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: /*input
  3
  5 4
  6 3 4 2 1
  4 2
  1 -4 0 -2
  3 2
  3 5 4
  
  */
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  public class Main
  {
  	static PrintWriter out;
  	static int MOD = 1000000007;
  	static FastReader scan;
  
      /*-------- I/O usaing short named function ---------*/
  	public static String ns(){return scan.next();}
  	public static int ni(){return scan.nextInt();}
  	public static long nl(){return scan.nextLong();}
  	public static double nd(){return scan.nextDouble();}
  	public static String nln(){return scan.nextLine();}
  	public static void p(Object o){out.print(o);}
  	public static void ps(Object o){out.print(o + " ");}
  	public static void pn(Object o){out.println(o);}
      /*-------- for output of an array ---------------------*/
       static void iPA(int arr []){
       	 StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
  	static void lPA(long arr []){
  	     StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
  	static void sPA(String arr []){
  	     StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
  	static void dPA(double arr []){
  	     StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
      /*-------------- for input in an array ---------------------*/
  	static void iIA(int arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = ni();
  	}
  	static void lIA(long arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = nl(); 
  	}
  	static void sIA(String arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = ns(); 
  	}
  	static void dIA(double arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = nd();
  	}
  	/*------------ for taking input faster ----------------*/
       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;
  		}
  	}
  
  	// Method to check if x is power of 2
      static boolean isPowerOfTwo (int x) { return x!=0 && ((x&(x-1)) == 0);}
      //Method to return gcd of two numbers
      static int gcd(int a, int b){return a==0?b:gcd(b % a, a); }
      //Method to count digit of a number
      static int countDigit(long n){return (int)Math.floor(Math.log10(n) + 1);}
      //Method for sorting
  	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);
  	}
  	//Method for sorting
  	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);
  	}
  	//Method foAr checking if a number is prime or not
  	static boolean isPrime(int n) { 
          if (n <= 1) return false; 
          if (n <= 3) return true; 
          if (n % 2 == 0 || n % 3 == 0) return false; 
          for (int i = 5; i * i <= n; i = i + 6) 
              if (n % i == 0 || n % (i + 2) == 0) 
              	return false; 
          return true; 
      } 
  
  	public static void main (String[] args) throws java.lang.Exception
  	{
          out =new PrintWriter(System.out);
          scan =new FastReader();
  		//for fast output sometimes
  		StringBuilder sb = new StringBuilder();
  		int t = ni();
  		while(t-->0){
  			int n = ni(), k = ni();
  			long arr[] = new long[n];
  			lIA(arr);
  			int count = 0;
  			HashMap<Long, Integer> map = new HashMap<>();
  			for(int i=0; i<n; i++){
  				map.put(arr[i], i);
  			}
  
  			sort(arr);
  
  			int pos[] = new int[n];
  			for(int i=0; i<n; i++){
  				pos[i] = map.get(arr[i]);
  			}
  			//iPA(pos);
  			for(int i=1; i<n; i++){
  				if(pos[i] != (pos[i-1] + 1)){
  					count++;
  				}
  			}
  			//pn(count);
  			count++;
  			if(count <= k){
  				pn("Yes");
  			}else{
  				pn("No");
  			}
          }
          out.flush();
  		out.close();
  	}
  	
  }