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 int maxn = 300005;
const int INF = 1001000001;
int a[maxn];
bool board[maxn];
int N, K;
void make(int cnt, int id, int l) {
  int r = a[id];
  long long x, y, z;
  x = y = z = 0;
  for (int i = 1; i <= cnt; i++) x += abs(l + i);
  for (int i = 1; i <= cnt; i++) y += abs(r - i);
  z = (long long)INF * INF;
  if (r > 0 && l < 0 && cnt / 2 < r && cnt / 2 - cnt + 1 > l) {
    z = 0;
    for (int i = 0; i < cnt; i++) z += abs(cnt / 2 - i);
  }
  if (z <= x && z <= y) {
    for (int i = 1; i <= cnt; i++) a[id - K * i] = cnt / 2 - i + 1;
  } else if (x <= z && x <= y) {
    for (int i = 1; i <= cnt; i++) a[id - K * (cnt - i + 1)] = l + i;
  } else {
    for (int i = 1; i <= cnt; i++) a[id - K * i] = r - i;
  }
}
int main() {
  cin >> N >> K;
  for (int i = 1 + K; i <= N + K; i++) {
    char s[100];
    scanf("%s", s);
    if (!strcmp("?", s))
      board[i] = 1;
    else
      sscanf(s, "%d", a + i);
  }
  for (int i = 1; i <= K; i++) {
    a[i] = -INF;
    a[i + K + N] = INF;
  }
  bool wa = 0;
  int cnt = 0;
  for (int i = 1; i <= K; i++) {
    int l = -INF;
    for (int j = K + i; j <= N + K * 2; j += K) {
      if (board[j]) {
        cnt++;
      } else {
        if (a[j] - l <= cnt) {
          wa = 1;
        }
        if (cnt > 0) make(cnt, j, l);
        cnt = 0;
        l = a[j];
      }
    }
  }
  if (wa)
    printf("Incorrect sequence\n");
  else
    for (int i = 1 + K; i <= N + K; i++)
      printf("%d%c", a[i], i == N + K ? '\n' : ' ');
  return 0;
}
