#include <bits/stdc++.h>
using namespace std;
long long v[100010];
int main() {
  long long n, k;
  cin >> n >> k;
  string s;
  getline(cin, s);
  getline(cin, s);
  char s2[s.size() + 1];
  strcpy(s2, s.c_str());
  char* pch;
  pch = strtok(s2, " ");
  long long i = -1;
  while (pch != NULL) {
    i++;
    if (pch[0] == '?') {
      pch = strtok(NULL, " ");
      v[i] = 1101000000;
      continue;
    }
    long long len = strlen(pch);
    bool neg = false;
    long long ini = 0;
    if (pch[0] == '-') {
      neg = true;
      ini++;
    }
    long long num = 0;
    for (; ini < len; ini++) {
      num *= 10;
      num += (pch[ini] - '0');
    }
    if (neg) num *= -1;
    v[i] = num;
    pch = strtok(NULL, " ");
  }
  bool resp = true;
  for (int i = 0; i < min((n - k + 1), k); i++) {
    vector<int> val;
    vector<int> maior, menor;
    for (int j = i; j < n; j += k) {
      val.push_back(v[j]);
      if (v[j] != 1101000000) {
        maior.push_back(v[j]);
        menor.push_back(v[j]);
      } else {
        maior.push_back(1101000000 - 1);
        menor.push_back(-(1101000000 - 1));
      }
    }
    int qtd = 0;
    for (int j = 0; j < val.size(); j++) {
      if (val[j] != 1101000000) {
        qtd++;
        for (int l = j + 1; l < val.size() && val[l] == 1101000000; l++) {
          menor[l] = max(menor[l], val[j] + l - j);
        }
        for (int l = j - 1; l >= 0 && val[l] == 1101000000; l--)
          maior[l] = min(maior[l], val[j] + (l - j));
      }
    }
    if (qtd == 0) {
      int f = val.size() / 2;
      f *= -1;
      for (int l = 0; l < val.size(); l++) val[l] = f++;
    } else {
      vector<int> posicao;
      for (int l = 0; l < val.size(); l++) {
        if (val[l] != 1101000000) posicao.push_back(l);
      }
      int f = min(max(menor[0], -(posicao[0] / 2)), maior[0]);
      for (int l = 0; l < posicao[0]; l++) {
        val[l] = f++;
      }
      if (posicao[posicao.size() - 1] != val.size() - 1) {
        f = min(
            maior[posicao[posicao.size() - 1] + 1],
            max(menor[posicao[posicao.size() - 1] + 1],
                (int)-((val.size() - posicao[posicao.size() - 1] - 1) / 2)));
        for (int l = posicao[posicao.size() - 1] + 1; l < val.size(); l++) {
          val[l] = f++;
        }
      }
      for (int h = 0; h < posicao.size() - 1; h++) {
        f = min(maior[posicao[h] + 1],
                max(menor[posicao[h] + 1],
                    -((posicao[h + 1] - posicao[h] - 1) / 2)));
        for (int l = posicao[h] + 1; l < posicao[h + 1]; l++) val[l] = f++;
      }
    }
    for (int j = i; j < n; j += k) v[j] = val[j / k];
  }
  for (int i = 0; i < n; i++)
    if (v[i] == 1101000000) v[i] = 0;
  vector<long long> gera;
  long long sum = 0;
  for (int i = 0; i < k; i++) {
    sum += v[i];
  }
  gera.push_back(sum);
  for (int i = k; i < n; i++) {
    sum += v[i];
    sum -= v[i - k];
    gera.push_back(sum);
  }
  for (int i = 0; i < gera.size() - 1 && resp; i++) {
    if (gera[i] >= gera[i + 1]) resp = false;
  }
  if (resp) {
    long long sum = 0;
    for (int i = 0; i < n; i++) {
      if (i) cout << " ";
      cout << v[i];
      sum += abs(v[i]);
    }
    cout << endl;
  } else {
    cout << "Incorrect sequence" << endl;
  }
  return 0;
}
