#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1E9 + 7;
const long long int MOD = 998244353;
const long long int N = 3E5 + 100;
const long long int INF = 1e18;
long long int fact[N], invfact[N];
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return res;
}
void init() {
  fact[0] = 1;
  long long int i;
  for (i = 1; i < N; i++) {
    fact[i] = i * fact[i - 1] % mod;
  }
  i--;
  invfact[i] = power(fact[i], mod - 2);
  i--;
  for (; i >= 0; i--) {
    invfact[i] = invfact[i + 1] * (i + 1) % mod;
  }
}
long long int ncr(long long int n, long long int r) {
  if (r > n || r < 0 || n < 0) return 0;
  return fact[n] * invfact[r] % mod * invfact[n - r] % mod;
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> v(n);
  long long int sum = 0;
  for (long long int &x : v) {
    cin >> x;
  }
  vector<long long int> arr = v;
  sort(arr.begin(), arr.end());
  long long int cnt = 1;
  long long int j = 0;
  for (long long int i = 1; i < n; i++) {
    if (v[i] > v[i - 1]) {
      long long int a =
          (long long int)(lower_bound(arr.begin(), arr.end(), v[i]) -
                          arr.begin());
      if (v[i - 1] == arr[a - 1]) {
        continue;
      }
    }
    cnt++;
  }
  (cnt > k) ? cout << "NO" << endl : cout << "YES" << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  cin >> t;
  for (long long int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
