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.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.HashMap;
  import java.util.StringTokenizer;
  
  public class Main {
  	
  	static class Aloo{
  		private int a;
  		private int b;
  		void show() {
  			System.out.println(a+b);
  		}
  	}
  	
  	static FastScanner fs = new FastScanner();
  
  	public static void main(String[] args) {
  		
  		FastScanner fs = new FastScanner();
  		int t = fs.nextInt();
  		while(t-->0) {
  			int n = fs.nextInt(), k =fs.nextInt();
  			int[] a = fs.readArray(n);
  			ArrayList<Integer> list = new ArrayList<>();
  			for(int i=0 ; i<n ; i++) {
  				list.add(a[i]);
  			}
  			Collections.sort(list);
  			HashMap<Integer,Integer> map = new HashMap<>();
  			int x = 0;
  			for(int e:list) {
  				map.put(e,x);
  				x++;
  			}
  			
  			int c=1;
  			
  			for(int i=1 ; i<n ; i++) {
  				int ind = map.get(a[i]);
  				if(ind!=0) {
  					if(list.get(ind-1)!=a[i-1]) c++;
  				}else {
  					c++;
  				}
  			}
  			System.out.println(c<=k?"Yes":"No");
  			
  		}
  		
  	}
  	
  	public static void check() {
  		Aloo a = new Aloo();
  		a.a = 1;
  		a.b = 3;
  		a.show();
  	}
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	
  	public static int[] readArray(int n){
  		int[] a = new int[n];
  		for(int i=0 ; i<n ; i++) {
  			a[i] = fs.nextInt();
  		}
          return a;
      }
  	
  	public static void printArray(int[] n){
          for(int e:n) {
          	System.out.print(e + " ");
          }
          System.out.println();
      }
  	
  	static int[] 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);
  		return a;
  	}
  	
  	static class FastScanner {
  		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st=new StringTokenizer("");
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st=new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  		
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		String[] readStringArray(int n) {
  			String[] a=new String[n];
  			for (int i=0; i<n; i++) a[i]=next();
  			return a;
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  	
  	
  
  }
  