#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int power(long long int x, long long int n) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % 1000000007;
    x = (x * x) % 1000000007;
    n = n / 2;
  }
  return result % 1000000007;
}
bool isPrime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int i = 0, n, p;
  cin >> n >> p;
  string str;
  cin >> str;
  bool y = false, z = false;
  long long int x = str.length();
  while (p < x) {
    if (str[i] == '1') {
      if (str[p] == '.') {
        str[p] = '0';
        z = true;
      } else if (str[p] == '0') {
        y = true;
        z = true;
      }
    } else if (str[i] == '0') {
      if (str[p] == '.') {
        str[p] = '1';
        z = true;
      } else if (str[p] == '1') {
        y = true;
        z = true;
      }
    } else {
      if (str[p] == '1') {
        str[i] = '0';
        z = true;
      } else if (str[p] == '0') {
        str[i] = '1';
        z = true;
      } else {
        str[i] = '1';
        str[p] = '0';
        z = true;
      }
    }
    i++;
    p++;
  }
  if (!z)
    cout << "No";
  else {
    for (i = 0; i < x; i++) {
      if (str[i] == '.')
        cout << 0;
      else
        cout << str[i];
    }
  }
}
