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.*;
  import java.util.*;
  import java.math.BigInteger;
  import java.util.InputMismatchException;
  
  public class Main {
  	static PrintWriter out;
  	static Reader in;
  	public static void main(String[] args) throws IOException {
  		input_output();
  		Main solver = new Main();
  		solver.solve();
  		out.close();
  
  		out.flush();
  	} 
  
  	static long INF = (long)1e18;
  	static int MAXN = (int)1e5 + 5;
  	static int MOD = (int)1e9 + 7;
  	static int q, t, n, m, k;
  	static double pi = Math.PI;
  
  	void solve() throws IOException {
  		t = in.nextInt();
  
  
  		while (t --> 0) {
  			n = in.nextInt();
  			k = in.nextInt();
  
  			int[] arr = new int[n];
  			for (int i = 0; i < n; i++) arr[i] = in.nextInt();
  
  			TreeSet<Integer> set = new TreeSet<>();
  			for (int i = 0; i < n; i++) set.add(arr[i]);
  			set.add(Integer.MAX_VALUE);
  
  			int steps = 1;
  			for (int i = 1; i < n; i++) {
  				if (arr[i] != set.higher(arr[i-1])) steps++;
  			}
  
  			if (steps <= k) out.println("Yes");
  			else out.println("No");
  		}
  	}
  
  
  	static class Reader {
  		private InputStream mIs;
  		private byte[] buf = new byte[1024];
  		private int curChar;
  		private int numChars;
  
  		public Reader() {
  			this(System.in);
  		}
  
  		public Reader(InputStream is) {
  			mIs = is;
  		}
  
  		public int read() {
  			if (numChars == -1) {
  				throw new InputMismatchException();
  
  			}
  			if (curChar >= numChars) {
  				curChar = 0;
  				try {
  					numChars = mIs.read(buf);
  				} catch (IOException e) {
  					throw new InputMismatchException();
  				}
  				if (numChars <= 0) {
  					return -1;
  				}
  			}
  			return buf[curChar++];
  		}
  
  		public String nextLine() {
  			int c = read();
  			while (isSpaceChar(c)) {
  				c = read();
  			}
  			StringBuilder res = new StringBuilder();
  			do {
  				res.appendCodePoint(c);
  				c = read();
  			} while (!isEndOfLine(c));
  			return res.toString();
  		}
  
  		public String next() {
  			int c = read();
  			while (isSpaceChar(c)) {
  				c = read();
  			}
  			StringBuilder res = new StringBuilder();
  			do {
  				res.appendCodePoint(c);
  				c = read();
  			} while (!isSpaceChar(c));
  			return res.toString();
  		}
  
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		public long nextLong() {
  			int c = read();
  			while (isSpaceChar(c)) {
  				c = read();
  			}
  			int sgn = 1;
  			if (c == '-') {
  				sgn = -1;
  				c = read();
  			}
  			long res = 0;
  			do {
  				if (c < '0' || c > '9') {
  					throw new InputMismatchException();
  				}
  				res *= 10;
  				res += c - '0';
  				c = read();
  			} while (!isSpaceChar(c));
  			return res * sgn;
  		}
  
  		public int nextInt() {
  			int c = read();
  			while (isSpaceChar(c)) {
  				c = read();
  			}
  			int sgn = 1;
  			if (c == '-') {
  				sgn = -1;
  				c = read();
  			}
  			int res = 0;
  			do {
  				if (c < '0' || c > '9') {
  					throw new InputMismatchException();
  				}
  				res *= 10;
  				res += c - '0';
  				c = read();
  			} while (!isSpaceChar(c));
  			return res * sgn;
  		}
  
  		public boolean isSpaceChar(int c) {
  			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
  		}
  
  		public boolean isEndOfLine(int c) {
  			return c == '\n' || c == '\r' || c == -1;
  		}
  
  	}
  	static void input_output() throws IOException {
  		File f = new File("in.txt");
  		if (f.exists() && !f.isDirectory()) {
  			in = new Reader(new FileInputStream("in.txt"));
  		} else in = new Reader();
  		f = new File("out.txt");
  		if (f.exists() && !f.isDirectory()) {
  			out = new PrintWriter(new File("out.txt"));
  		} else out = new PrintWriter(System.out);
  	}
  }