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: /*
                         _oo0oo_
                        o8888888o
                        88" . "88
                        (| -_- |)
                        0\  =  /0
                      ___/`---'\___
                    .' \\|     |// '.
                   / \\|||  :  |||// \
                  / _||||| -:- |||||- \
                 |   | \\\  -  /// |   |
                 | \_|  ''\---/''  |_/ |
                 \  .-\__  '-'  ___/-. /
               ___'. .'  /--.--\  `. .'___
            ."" '<  `.___\_<|>_/___.' >' "".
           | | :  `- \`.;`\ _ /`;.`/ - ` : | |
           \  \ `_.   \_ __\ /__ _/   .-` /  /
       =====`-.____`.___ \_____/___.-`___.-'=====
                         `=---='
   
  */
  import java.util.function.Consumer;
  import java.util.*;
  import java.math.BigDecimal;
  import java.math.BigInteger;
  import java.math.RoundingMode;
  import java.text.DecimalFormat;
  import java.io.*;
  import java.lang.Math.*;
   public class KickStart2020{
  	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());}
          float nextFloat() {return Float.parseFloat(next());}
          String nextLine() {
              String str = "";
              try {str = br.readLine();}
              catch (IOException e) { e.printStackTrace();}
              return str; }}
  	static boolean isBracketSequence(String s, int a, int b) {
  		Stack<Character> ss = new Stack<>();
  		boolean hachu = true;
  		for(int i = a; i <= b; i++) {
  			if(s.charAt(i) == ')' && ss.isEmpty()) {hachu = false; break;}
  			if(s.charAt(i) == '(') ss.add('(');
  			else ss.pop();
  		}
  		return ss.empty() && hachu;
  	}
  	static String reverseOfString(String a) {
  		StringBuilder ssd = new StringBuilder();
  		for(int i = a.length() - 1; i >= 0; i--) {
  			ssd.append(a.charAt(i));
  		}
  		return ssd.toString();
  	}
  	static char[] reverseOfChar(char a[]) {
  		char b[] = new char[a.length];
  		int j = 0;
  		for(int i = a.length - 1; i >= 0; i--) {
  			b[i] = a[j];
  			j++;
  		}
  		return b;
  	}
  	static boolean isPalindrome(char a[]) {
  		boolean hachu = true;
  		for(int i = 0; i <= a.length / 2; i++) {
  			if(a[i] != a[a.length - 1 - i]) {
  				hachu = false;
  				break;
  			}
  		}
  		return hachu;
  	} 
  	static long gcd(long a, long b)
  	{
  	    if (b == 0)
  	        return a;
  	    return gcd(b, a % b);
  	     
  	}
  	static long powermod(long x, long y, long mod){
  	    long ans = 1;
  	    x = x % mod; 
  	    if (x == 0)
  	      return 0; 
  	    int i = 1;
  	    while (y > 0){
  	      if ((y & 1) != 0)
  	        ans = (ans * x) % mod;
  	      y = y >> 1; 
  	      x = (x * x) % mod;
  	    }
  	    return ans;
  	  }
  	static long power(long x, long y){
  	    long ans = 1;
  	    if (x == 0)
  	      return 0; 
  	    int i = 1;
  	    while (y > 0){
  	      if ((y & 1) != 0)
  	        ans = (ans * x);
  	      y = y >> 1; 
  	      x = (x * x);
  	    }
  	    return ans;
  	  }
  	static boolean check(String a) {
  		boolean hachu = true;
  		for(int i = 0; i < a.length(); i++) {
  			if(a.charAt(0) != a.charAt(i)) {hachu = false; break;}
  		}
  		return hachu;
  	}
  	 public static class Pair implements Comparable<Pair> {
  	        public  int index;
  	        public  int value;
  	 
  	        public Pair(int index, int value) {
  	            this.index = index;
  	            this.value = value;
  	        }
  	        @Override
  	        public int compareTo(Pair other) {
  	            //multiplied to -1 as the author need descending sort order
  	            return   -1 * Integer.valueOf(this.index).compareTo(other.index);
  	        }
  	 }
  	 static boolean equalString(int i, int j, int arr[], String b) {
  		 int brr[] = new int[26];
  		 for(int k = i; k <= j; k++) brr[b.charAt(k) - 'a']++;
  		 for(int k = 0; k < 26; k++) {
  			 if(arr[k] != brr[k]) return false;
  		 }
  		 return true;
  	 }
  	 static boolean cequalArray(String a, String b) {
  		  int count[] = new int[26];
  		  int count1[] = new int[26];
  		  for(int i = 0; i < a.length(); i++) count[a.charAt(i) - 'a']++;
  		  for(int i = 0; i < a.length(); i++) count1[b.charAt(i) - 'a']++;
  		  for(int i = 0; i < 26; i++) if(count[i] != count1[i]) return false;
  		  return true;
  	 }
  	 static boolean isPrime(long d) {
  		 if(d == 1) return true;
  		 for(int i = 2; i <= (long)Math.sqrt(d); i++) {
  			 if(d % i == 0) return false;
  		 }
  		 return true;
  	 }
  	 static String decimalTob(int n, int b, String g) {
  		  int z = n % b;
  		  g = String.valueOf(z) + g;
  		  n /= b;
  		  if(n > 0) {
  			  g = decimalTob(n, b, g);
  		  }
  		  return g;
  	 }
  		public static void main(String[] args) throws Exception{
  			FastReader sc = new FastReader();
  			PrintWriter out = new PrintWriter(System.out);
                int t = sc.nextInt();
                while(t-- > 0) {
              	  int n = sc.nextInt();
              	  int k = sc.nextInt();
              	  int arr[] = new int[n];
              	  int brr[] = new int[n];
              	  for(int i = 0; i < n; i++) brr[i] = arr[i] = sc.nextInt();
              	  Arrays.sort(arr);
              	  HashMap<Integer,Integer> ss = new HashMap<>();
              	  for(int i = 0; i < n; i++) ss.put(arr[i], i);
              	  int i = 0;
              	  int count = 0;
              	  while(i < n) {
              		  while(i < n - 1 && brr[i] < brr[i + 1] && ss.get(brr[i]) + 1 == ss.get(brr[i + 1])) {
  //            			  out.println(ss.get(brr[i]) + " " + ss.get(brr[i + 1]));
              			  i++;
              		  }
  //            		  out.println(i);
              		  count++;
              		 i++;
              	  }
  //            	  out.println(count);
              	 if(count <= k) out.println("Yes");
              	 else out.println("No");
              	  }
                   out.close();
  			}
  		}