#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int maxn = 100010;
int n, k;
char s[20];
int a[maxn];
bool flag[maxn];
void solve() {
  memset(a, 0, sizeof(a));
  memset(flag, 0, sizeof(flag));
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    if (s[0] == '?')
      flag[i + 1] = 1;
    else {
      bool neg = false;
      if (s[0] == '-') neg = true;
      for (int j = neg; j < strlen(s); j++) a[i] = a[i] * 10 + s[j] - '0';
      if (neg) a[i] *= -1;
    }
  }
  for (int i = 0; i < k; i++) {
    vector<int> pos;
    vector<pair<int, int> > tmp;
    tmp.push_back(make_pair(INT_MIN / 2, 0));
    pos.push_back(0);
    for (int j = i; j < n; j += k) {
      if (!flag[j + 1]) {
        pos.push_back(int((tmp).size()));
      }
      tmp.push_back(make_pair(a[j], j));
    }
    pos.push_back(int((tmp).size()));
    tmp.push_back(make_pair(INT_MAX / 2, 0));
    for (int j = 0; j < int((pos).size()) - 1; j++) {
      int k = pos[j + 1] - pos[j] - 1;
      int u = tmp[pos[j]].first + 1;
      int v = tmp[pos[j + 1]].first - 1;
      if (v - u + 1 < k) {
        printf("Incorrect sequence");
        return;
      }
      if (u >= 0) {
        int cnt = 0;
        for (int l = pos[j] + 1; l < pos[j + 1]; l++)
          a[tmp[l].second] = u + (cnt++);
      } else if (v <= 0) {
        int cnt = 0;
        for (int l = pos[j] + 1; l < pos[j + 1]; l++)
          a[tmp[l].second] = v - k + (++cnt);
      } else {
        vector<int> w;
        w.push_back(0);
        for (int l = 1; l < k; l++) {
          if (int((w).size()) == k) break;
          if (l >= u && l <= v) w.push_back(l);
          if (int((w).size()) == k) break;
          if (-l >= u && -l <= v) w.push_back(-l);
        }
        sort(w.begin(), w.end());
        int cnt = 0;
        for (int l = pos[j] + 1; l < pos[j + 1]; l++)
          a[tmp[l].second] = w[cnt++];
      }
    }
  }
  for (int i = 0; i < n - k; i++)
    if (a[i] >= a[i + k]) {
      printf("Incorrect sequence");
      return;
    }
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
}
int main() {
  solve();
  return 0;
}
