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 sys
  import math
  import bisect
  from sys import stdin,stdout
  from math import gcd,floor,sqrt,log
  from collections import defaultdict as dd
  from bisect import bisect_left as bl,bisect_right as br
  
  sys.setrecursionlimit(100000000)
  
  inp    =lambda: int(input())
  strng  =lambda: input().strip()
  jn     =lambda x,l: x.join(map(str,l))
  strl   =lambda: list(input().strip())
  mul    =lambda: map(int,input().strip().split())
  mulf   =lambda: map(float,input().strip().split())
  seq    =lambda: list(map(int,input().strip().split()))
  seq_nll    =lambda: list(map(int,input().strip()))
  
  ceil   =lambda x: int(x) if(x==int(x)) else int(x)+1
  ceildiv=lambda x,d: x//d if(x%d==0) else x//d+1
  
  flush  =lambda: stdout.flush()
  stdstr =lambda: stdin.readline()
  stdint =lambda: int(stdin.readline())
  stdpr  =lambda x: stdout.write(str(x))
  
  mod=1000000007
  
  
  #main code
  
  # vijayantyadav11
  
  for _ in range(int(input())):
      n,k = input().split()
      ls = seq()
      n= int(n)
      k= int(k)
      cnt = 1
      a = sorted(ls)
      dic = dict()
      for i in range(n-1):
          dic[a[i]]=a[i+1]
      for i in range(1,n):
          if ls[i]<ls[i-1] or dic[ls[i-1]]!=ls[i]:
              cnt+=1
          # else:
          #     if dic[ls[i-1]]!=ls[i]:
          #         cnt+=1
      if(k>=cnt):
          print("YES")
      else:
          print("NO")
  
  
      # print(n,ls)