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 A145 
  {
  	static class Pair {
  		long x;
  		int y;
  
  		// Constructor 
  		public Pair(long x, int y) {
  			this.x = x;
  			this.y = y;
  		}
  	}
  
  	public static void process()throws IOException
  	{
         int n=I();
        
         int k=I();
         long a[]=Al(n);
         long c[]=a.clone();
         if(n==1)
         {
      	   if(k==1)
      	   {
      	   pn("Yes");
      	   return;
      	   }
      	   else
      	   {
      	   pn("No");
      	   return;
      	   }
         }
        
         HashMap<Long,Integer> map=new HashMap<Long,Integer>();
  		for(int i=0;i<n;i++)
  		{
  			map.put(a[i],i);
  		}
  		Arrays.sort(c);
  	
  	
  		int dp[]=new int[n];int t=0;
  		for(int i=1;i<n;i++)
  		{
  			  int ind=map.get(c[i-1]);
  			 int ind1=map.get(c[i]);
  			
  			 if(ind1-ind==1)
  			 {
  								 
  					 t++;
  				 
  				 
  			 }
  		}
  	
  		if(k>=n-t && k<=n)
  		{
  			pn("Yes");
  		}
  		else
  		{
  			pn("No");
  		}
  		
  		
  		
  	}
  	static Scanner sc = new Scanner(System.in);
  	static PrintWriter out = new PrintWriter(System.out);
  	static void pn(Object o){out.println(o);out.flush();}
  	static void p(Object o){out.print(o);out.flush();}
  	static void pni(Object o){out.println(o);System.out.flush();}
  	static int I() throws IOException{return sc.nextInt();}
  	static long L() throws IOException{return sc.nextLong();}
  	static double D() throws IOException{return sc.nextDouble();}
  	static String S() throws IOException{return sc.next();}
  	static char C() throws IOException{return sc.next().charAt(0);}
  	static int[] Ai(int n) throws IOException{int[] arr = new int[n];for (int i = 0; i < n; i++)arr[i] = I();return arr;}
  	static String[] As(int n) throws IOException{String s[] = new String[n];for (int i = 0; i < n; i++)s[i] = S();return s;}
  	static long[] Al(int n) throws IOException {long[] arr = new long[n];for (int i = 0; i < n; i++)arr[i] = L();return arr;}
  	static void dyn(int dp[][],int n,int m,int z)throws IOException {for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ dp[i][j]=z;}} }
  	
  //	*--------------------------------------------------------------------------------------------------------------------------------*//
  	static class AnotherReader {BufferedReader br;StringTokenizer st;AnotherReader() throws FileNotFoundException {br = new BufferedReader(new InputStreamReader(System.in));}
  	AnotherReader(int a) throws FileNotFoundException {br = new BufferedReader(new FileReader("input.txt"));}
  	String next() throws IOException{while (st == null || !st.hasMoreElements()) {try {st = new StringTokenizer(br.readLine());} catch (IOException e) {e.printStackTrace();}}return st.nextToken();}
  	int nextInt() throws IOException {return Integer.parseInt(next());}
  	long nextLong() throws IOException {return Long.parseLong(next());}
  	double nextDouble() throws IOException {return Double.parseDouble(next());}
  	String nextLine() throws IOException {String str = "";try {str = br.readLine();} catch (IOException e) {e.printStackTrace();}return str;}}
  	public static void main(String[] args)throws IOException{try{boolean oj=true;if(oj==true)
  	{AnotherReader sk=new AnotherReader();PrintWriter out=new PrintWriter(System.out);}
  	else
  	{AnotherReader sk=new AnotherReader(100);out=new PrintWriter("output.txt");}
  	long T=L();while(T-->0)
  	{process();}out.flush();out.close();}catch(Exception e){return;}}}
  //*-----------------------------------------------------------------------------------------------------------------------------------*//
  	