#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 9;
const long long inf = -1e15;
bool mark[maxn];
long long arr[maxn];
char s[111];
long long sol() {
  long long fu = 1;
  long long d = 0;
  if (s[0] == '-') {
    fu = -1;
    d++;
  }
  long long g = 0;
  for (; s[d]; d++) {
    g *= 10;
    g += s[d] - '0';
  }
  g *= fu;
  return g;
}
long long n, k;
queue<long long> pos;
long long ttt[maxn];
bool t;
void cal(long long chu, long long zhong, long long len) {
  if (!len) return;
  for (long long i = 0, e = -(len >> 1); i < len; i++, e++) {
    ttt[i] = e;
  }
  if (chu == inf && zhong == inf) {
    return;
  }
  if (chu == inf) {
    if (zhong <= ttt[len - 1]) {
      long long f = ttt[len - 1] - zhong + 1ll;
      for (long long i = 0; i < len; i++) {
        ttt[i] -= f;
      }
    }
    return;
  }
  if (zhong == inf) {
    if (chu >= ttt[0]) {
      long long f = chu - ttt[0] + 1;
      for (long long i = 0; i < len; i++) {
        ttt[i] += f;
      }
    }
    return;
  }
  if (zhong - chu - 1 < len) {
    t = 0;
    return;
  }
  if (chu >= 0) {
    for (long long i = 0; i < len; i++) {
      ttt[i] = chu + 1 + i;
    }
  } else if (zhong <= 0) {
    for (long long i = len - 1, e = 1; i >= -1; i--, e++) {
      ttt[i] = zhong - e;
    }
  } else {
    if (chu >= ttt[0]) {
      long long f = chu - ttt[0] + 1;
      for (long long i = 0; i < len; i++) {
        ttt[i] += f;
      }
    }
    if (zhong <= ttt[len - 1]) {
      long long f = ttt[len - 1] - zhong + 1ll;
      for (long long i = 0; i < len; i++) {
        ttt[i] -= f;
      }
    }
  }
}
void chuli() {
  int d = 0;
  while (!pos.empty()) {
    long long f = pos.front();
    pos.pop();
    arr[f] = ttt[d++];
  }
}
int main() {
  long long a, b, c, d, e, f, g, h;
  ios::sync_with_stdio(0);
  while (cin >> n >> k) {
    memset(mark, 0, sizeof(mark));
    for (d = 1; d <= n; d++) {
      cin >> s;
      if (s[0] == '?') {
        mark[d] = 1;
      } else {
        arr[d] = sol();
      }
    }
    t = 1;
    for (d = 1; d <= k; d++) {
      g = h = 0;
      for (e = d; e <= n; e += k) {
        if (!mark[e]) {
          g = 1;
          break;
        }
        pos.push(e);
      }
      if (!g) {
        cal(inf, inf, pos.size());
        chuli();
        continue;
      }
      cal(inf, arr[e], pos.size());
      chuli();
      f = arr[e];
      for (e += k; e <= n; e += k) {
        if (mark[e]) {
          pos.push(e);
        } else {
          cal(f, arr[e], pos.size());
          chuli();
          f = arr[e];
        }
      }
      cal(f, inf, pos.size());
      chuli();
    }
    for (d = 1; d <= k && t; d++) {
      for (e = d + k; e <= n; e += k) {
        if (arr[e] <= arr[e - k]) {
          t = 0;
          break;
        }
      }
    }
    if (t) {
      cout << arr[1];
      for (d = 2; d <= n; d++) {
        cout << ' ' << arr[d];
      }
      cout << endl;
    } else {
      cout << "Incorrect sequence" << endl;
    }
  }
  return 0;
}
