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.*;
  import java.lang.*;
  import java.util.jar.JarEntry;
  
  public class Main{
      /* || श्री गणेशाय नमः ||
         @𝐚𝐮𝐭𝐡𝐨𝐫 𝐉𝐢𝐠𝐚𝐫 𝐍𝐚𝐢𝐧𝐮𝐣𝐢
         𝐒𝐕𝐍𝐈𝐓- 𝐒𝐮𝐫𝐚𝐭
      */
      public static void main(String args[]){
          InputReader in=new InputReader(System.in);
          TASK solver = new TASK();
          int t=1;
          t = in.nextInt();
          for(int i=1;i<=t;i++)
          {
              solver.solve(in,i);
          }
      }
      static class TASK {
          static int dp[] = new int[32];
          static {
              dp[0]=1;
              for(int i=1;i<32;i++)
              {
                  dp[i]=dp[i-1]*2;
              }
          }
  
  
          void solve(InputReader in, int testNumber) {
              int n = in.nextInt();
              int k = in.nextInt();
              int a[] = new int[n];
              int b[] = new int[n];
              for(int i=0;i<n;i++) {
                  a[i] = in.nextInt();
                  b[i]=a[i];
              }
              Arrays.sort(b);
              Map<Integer,Integer> map = new HashMap<>();
              int idx=1;
              for(int i=0;i<n;i++)
              {
                  map.put(b[i],idx);
                  idx++;
              }
              int c=0;
              for(int i=1;i<n;i++)
              {
                  if(map.get(a[i])-map.get(a[i-1])!=1)
                      c++;
              }
              if(c+1<=k)
                  System.out.println("Yes");
              else
                  System.out.println("No");
  
  
  
          }
      }
  
  
      static class pair{
          int x;
          int y;
          pair(int x,int y)
          {
              this.x=x;
              this.y=y;
          }
      }
      static class bb{
          int a[] = new int[5];
      }
  
      static class Maths {
          static long gcd(long a, long b) {
              if (a < b)
                  return gcd(b,a);
              if (b == 0)
                  return a;
              else
                  return gcd(b,a%b);
          }
          public static long lcm(long a, long b) {
              return (a * b) / gcd(a, b);
          }
  
      }
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
          public int read() {
              if (numChars == -1)
                  throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0)
                      return -1;
              }
              return buf[curChar++];
          }
          public String nextLine() {
              BufferedReader br = new BufferedReader(new
                      InputStreamReader(System.in));
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          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 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 double nextDouble() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E')
                      return res * Math.pow(10, nextInt());
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E')
                          return res * Math.pow(10, nextInt());
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
          public String readString() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              }
              while (!isSpaceChar(c));
              return res.toString();
          }
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c
                      == -1;
          }
          public String next() {
              return readString();
          }
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  }
  
  