7 2
-10 0 ? 1 ? 2 10
 1 1
0
 5 1
-3 -2 -1 0 1
 7 1
-4 ? ? ? ? ? 2
 17 1
? -13 ? ? ? -3 ? ? ? ? ? 10 ? ? ? ? 100
 3 1
-5 ? 0
 7 2
-10 0 ? 1 6 2 ?
 3 1
-3 ? -2
 6 1
-1 ? 1 2 3 4
 1 1
?
 9 2
-10 0 ? 1 ? 2 ? 3 ?
 10 2
3 ? 5 ? 7 ? 9 ? 11 ?
 9 2
? ? -10 ? ? ? 10 ? ?
 9 3
? ? ? ? ? ? ? ? ?
 7 2
? ? 10 ? ? ? ?
 5 1
1000000000 ? ? ? ?
 7 3
1 ? -1000000000 ? 100 ? 2
 7 2
? ? -10 ? ? ? ?
 39 3
-5 1 -13 ? 2 -12 ? 3 -11 -2 4 -10 ? 5 -9 0 6 -8 ? 7 -7 ? 8 -6 5 9 -5 ? 10 -4 ? 11 -3 ? 12 -2 10 13 -1
 7 2
? ? 10 ? -10 ? ?
 7 1
-2 ? ? ? ? ? 4
 7 2
-10 0 0 1 ? 2 ?
 9 2
-10 0 ? 1 -6 2 ? 3 ?
 7 3
1 ? -1000000000 ? 100 ? 3
 9 2
-10 0 ? 1 ? 2 ? 3 0
 9 2
10 0 ? 1 ? 2 ? 3 ?
 3 1
-1 ? 1
 10 1
-2 ? ? ? ? ? ? 5 ? 10
 5 2
? ? -1000000000 ? ?
 2 1
-1000000000 1000000000
 7 2
-10 0 ? 1 -6 2 ?
 5 4
-1 ? ? ? 2
 7 2
10 0 ? 1 ? 2 ?
 7 2
-10 0 ? 1 ? 2 0
 7 2
-10 0 ? 1 ? 2 ?
 7 2
? ? -10 ? 10 ? ?
 6 1
-3 ? ? ? ? 3
 9 2
-10 0 ? 1 ? 2 ? 3 10
 3 1
4 ? 5
 9 3
-5 0 -1 ? ? ? 0 5 1
 7 1
-3 ? ? ? ? ? 3

-10 0 -1 1 0 2 10
 0
 -3 -2 -1 0 1
 -4 -3 -2 -1 0 1 2
 -14 -13 -6 -5 -4 -3 -2 -1 0 1 2 10 11 12 13 14 100
 -5 -1 0
 -10 0 0 1 6 2 7
 Incorrect sequence
 -1 0 1 2 3 4
 0
 -10 0 -2 1 -1 2 0 3 1
 3 -2 5 -1 7 0 9 1 11 2
 -11 -2 -10 -1 0 0 10 1 11
 -1 -1 -1 0 0 0 1 1 1
 0 -1 10 0 11 1 12
 1000000000 1000000001 1000000002 1000000003 1000000004
 Incorrect sequence
 -11 -1 -10 0 -1 1 0
 -5 1 -13 -4 2 -12 -3 3 -11 -2 4 -10 -1 5 -9 0 6 -8 1 7 -7 2 8 -6 5 9 -5 6 10 -4 7 11 -3 8 12 -2 10 13 -1
 Incorrect sequence
 -2 -1 0 1 2 3 4
 -10 0 0 1 1 2 2
 -10 0 -7 1 -6 2 -1 3 0
 1 0 -1000000000 2 100 0 3
 -10 0 -3 1 -2 2 -1 3 0
 10 0 11 1 12 2 13 3 14
 -1 0 1
 -2 -1 0 1 2 3 4 5 6 10
 -1000000001 -1 -1000000000 0 0
 -1000000000 1000000000
 -10 0 -7 1 -6 2 0
 -1 0 0 0 2
 10 0 11 1 12 2 13
 -10 0 -2 1 -1 2 0
 -10 0 -1 1 0 2 1
 -11 -1 -10 0 10 1 11
 -3 -2 -1 0 1 3
 -10 0 -1 1 0 2 1 3 10
 Incorrect sequence
 -5 0 -1 -1 1 0 0 5 1
 -3 -2 -1 0 1 2 3 

#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 30;
const long long LINF = 1ll << 61;
int n, k, a[100111], pre[100111], nxt[100111];
bool que[100111];
inline int getval(bool &bol) {
  int __res = 0;
  bool __neg = 0;
  char __c;
  __c = getchar();
  while (__c == ' ' || __c == '\n') __c = getchar();
  if (__c == '?') {
    bol = 1;
    return 0;
  }
  while (__c != ' ' && __c != '\n') {
    if (__c == '-')
      __neg = 1;
    else
      __res = __res * 10 + __c - '0';
    __c = getchar();
  }
  if (__neg) __res = -__res;
  return __res;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) a[i] = getval(que[i]);
  for (int i = 1; i <= n; i++) {
    if (i > k) {
      if (!que[i - k])
        pre[i] = a[i - k];
      else
        pre[i] = pre[i - k];
    } else
      pre[i] = -INF;
  }
  for (int i = n; i >= 1; i--) {
    if (i + k <= n) {
      if (!que[i + k])
        nxt[i] = a[i + k];
      else
        nxt[i] = nxt[i + k];
    } else
      nxt[i] = INF;
  }
  for (int i = 1; i <= n; i++) {
    if (pre[i] + 1 >= nxt[i] || !que[i] && (pre[i] >= a[i] || a[i] >= nxt[i])) {
      puts("Incorrect sequence");
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (que[i]) {
      int j = i, l = j, r = j, cnt = 0;
      while (j <= n && que[j]) que[j] = 0, j += k, r = j, cnt++;
      r -= k;
      int mid = l + ((r - l) / k + 1) / 2 * k;
      if (nxt[l] - pre[l] - 1 < cnt) {
        puts("Incorrect sequence");
        return 0;
      }
      a[mid] = max(min(nxt[i] - 1 - (cnt - 1) / 2, 0), pre[i] + 1 + cnt / 2);
      for (j = mid - k; j >= l; j -= k) a[j] = a[j + k] - 1;
      for (j = mid + k; j <= r; j += k) a[j] = a[j - k] + 1;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
