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 UNKNOWN = 0x7FFFFFFF;
int N, K;
int A[100000];
bool seen[100000];
int nbad, last;
void fail() {
  printf("Incorrect sequence\n");
  exit(0);
}
void fix_bad(int pos, int cur) {
  if (cur - last - 1 < nbad) fail();
  if (nbad == 0) return;
  if (last <= 0 && cur <= 0) {
    for (int i = 0; i <= nbad; i++)
      if (0 <= pos - i * K && pos - i * K < N) A[pos - i * K] = cur - i;
  } else if (last >= 0 && cur >= 0) {
    for (int i = 1; i <= nbad + 1; i++)
      if (0 <= pos - i * K && pos - i * K < N)
        A[pos - i * K] = last - i + nbad + 1;
  } else {
    vector<int> toadd;
    toadd.push_back(0);
    int n = 1;
    while ((int)toadd.size() < nbad) {
      if (last < n && n < cur) toadd.push_back(n);
      if ((int)toadd.size() >= nbad) break;
      if (last < -n && -n < cur) toadd.push_back(-n);
      n++;
    }
    sort(toadd.rbegin(), toadd.rend());
    for (int i = 1; i <= nbad; i++)
      if (0 <= pos - i * K && pos - i * K < N) A[pos - i * K] = toadd[i - 1];
  }
}
void dfs(int u) {
  if (u >= N) {
    if (nbad) fix_bad(u, 1050000000);
    return;
  }
  seen[u] = true;
  if (A[u] == UNKNOWN)
    nbad++;
  else {
    fix_bad(u, A[u]);
    nbad = 0;
    last = A[u];
  }
  dfs(u + K);
}
int main() {
  scanf("%d%d", &N, &K);
  char c;
  for (int i = 0; i < N; i++) {
    scanf(" %c", &c);
    if (c == '?')
      A[i] = UNKNOWN;
    else {
      ungetc(c, stdin);
      scanf("%d", A + i);
    }
  }
  for (int i = 0; i < N; i++)
    if (!seen[i]) {
      last = -1050000000;
      nbad = 0;
      dfs(i);
    }
  for (int i = 0; i < N; i++) printf("%d%c", A[i], " \n"[i == N - 1]);
  return 0;
}
