#include <bits/stdc++.h>  // {{{

// https://codeforces.com/blog/entry/96344

#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

template <typename T>
[[nodiscard]] static T MIN() {
  return std::numeric_limits<T>::min();
}

template <typename T>
[[nodiscard]] static T MAX() {
  return std::numeric_limits<T>::max();
}

template <typename T>
[[nodiscard]] static T sc(auto&& x) {
  return static_cast<T>(x);
}

template <typename T>
[[nodiscard]] static T sz(auto&& x) {
  return static_cast<T>(x.size());
}

#define prln(...) std::println(__VA_ARGS__)
#define pr(...) std::print(__VA_ARGS__)

#ifdef LOCAL
#define dbgln(...) std::println(__VA_ARGS__)
#define dbg(...) std::print(__VA_ARGS__)
#endif

inline static void NO() {
  prln("NO");
}

inline static void YES() {
  prln("YES");
}

using ll = long long;
using ld = long double;
template <typename T>
using ve = std::vector<T>;
template <typename T, size_t N>
using ar = std::array<T, N>;
template <typename T1, typename T2>
using pa = std::pair<T1, T2>;
template <typename... Ts>
using tu = std::tuple<Ts...>;
template <typename... Ts>
using dq = std::deque<Ts...>;
template <typename... Ts>
using qu = std::queue<Ts...>;
template <typename... Ts>
using pq = std::priority_queue<Ts...>;
template <typename... Ts>
using st = std::stack<Ts...>;
auto lb = [](auto... args) {
  return std::lower_bound(args...);
};
auto ub = [](auto... args) {
  return std::upper_bound(args...);
};

#define ff first
#define ss second
#define eb emplace_back
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
//  }}}

void solve() {
  int n, k;
  cin >> n >> k;
  ve<int> colors(n);
  for (auto& e : colors) {
    cin >> e;
  }

  // have to start on tile 1, greedily take first k
  // then, greedily take (backwards) from n - 1 until when you stopped
  // note divisibility

  int seen = 0;
  int i;
  for (i = 0; i < n && seen < k; ++i) {
    if (colors[i] == colors[0])
      ++seen;
  }

  if (colors[0] == colors[n - 1]) {
    int x = 0;
    for (int j = 0; j < n; ++j)
      if (colors[j] == colors[0])
        ++x;
    if (x >= k) {
      YES();
      return;
    }
  }

  // dbgln("found first {} elems {}, ending at {}", seen, colors[0], i);

  if (i == n) {
    if (seen % k == 0) {
      YES();
    } else {
      NO();
    }
    return;
  }

  seen = 0;
  for (int j = n - 1; j >= i && seen < k; --j) {
    if (colors[j] == colors[n - 1])
      ++seen;
  }

  if (seen % k == 0) {
    YES();
  } else {
    NO();
  }
}

int main() {  // {{{
  cin.tie(nullptr)->sync_with_stdio(false);
  cin.exceptions(cin.failbit);

  int t = 1;
  cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}
// }}}