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>
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const long long LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const double pi = acos(-1.0);
const double EPS = 1e-6;
const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};
const long long MOD = 1e9 + 7;
const int MAXN = 100 + 10;
const int MAXT = 100000 + 10;
using namespace std;
int n, k, a[MAXT];
int main() {
  while (scanf("%d%d", &n, &k) == 2) {
    memset(a, INT_INF, sizeof a);
    char s[20];
    for (int i = 0; i < n; ++i) {
      scanf("%s", s);
      if (s[0] == '?') continue;
      sscanf(s, "%d", &a[i]);
    }
    bool flag = true;
    for (int i = 0; i < k; ++i) {
      int l = i, alllen = 0;
      for (int j = i; j < n; j += k) {
        ++alllen;
        if (a[j] == INT_INF) continue;
        if (j == l) {
          if (j != i && a[j] <= a[j - k]) {
            flag = false;
            goto op;
          }
          l = j + k;
          continue;
        }
        if (l - k < 0) {
          int tmp, len = (j - i) / k;
          if (len % 2)
            tmp = len / 2 < a[j] - 1 ? len / 2 : a[j] - 1;
          else
            tmp = len / 2 - 1 < a[j] - 1 ? len / 2 - 1 : a[j] - 1;
          for (int u = j - k; u >= i; u -= k) a[u] = tmp--;
          l = j + k;
        } else {
          int tmp, len = (j - l) / k;
          if (len > a[j] - a[l - k] - 1) {
            flag = false;
            goto op;
          }
          if (len % 2) {
            tmp = len / 2 < a[j] - 1 ? len / 2 : a[j] - 1;
            if (tmp - len + 1 <= a[l - k]) tmp = a[l - k] + len;
          } else {
            tmp = len / 2 - 1 < a[j] - 1 ? len / 2 - 1 : a[j] - 1;
            if (tmp - len + 1 <= a[l - k]) tmp = a[l - k] + len;
          }
          for (int u = j - k; u >= l; u -= k) a[u] = tmp--;
          l = j + k;
        }
      }
      if (l < n) {
        if (l - k < 0) {
          int tmp = -alllen / 2;
          for (int u = i; u < n; u += k) a[u] = tmp++;
        } else {
          int len = (n - l) / k;
          int tmp = -len / 2 < a[l - k] + 1 ? a[l - k] + 1 : -len / 2;
          for (int u = l; u < n; u += k) a[u] = tmp++;
        }
      }
    }
  op:
    if (!flag)
      printf("Incorrect sequence\n");
    else {
      for (int i = 0; i < n; ++i) {
        if (i) printf(" ");
        printf("%d", a[i]);
      }
      printf("\n");
    }
  }
  return 0;
}
