#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  cout << t;
  if (sizeof...(v)) cout << ", ";
  _print(v...);
}
using ll = long long int;
using ld = long double;
template <typename T, typename V>
using P = pair<T, V>;
template <typename T>
using V = vector<T>;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 0x3f3f3f3f;
constexpr ld PI = 3.1415926535897932384626;
constexpr ld EPS = 1e-9;
constexpr ll MAX = 1e6 + 5;
void solve() {
  ll n, k;
  string s;
  cin >> n >> k >> s;
  ll o = 0, z = 0;
  for (ll i = (ll)(0); i < (ll)(k); i++) {
    char c = '?';
    for (ll j = i; j < n; j += k)
      if (s[j] != '?') {
        if (c == '?')
          c = s[j];
        else if (c != s[j])
          return void(cout << "NO\n");
      }
    if (c == '1')
      o++;
    else if (c == '0')
      z++;
  }
  if (o > k / 2 || z > k / 2)
    cout << "NO\n";
  else
    cout << "YES\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t = 1;
  cin >> t;
  while (t--) solve();
}
