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;
char s[200005];
bool vis[200005];
int a[200005];
int n, m;
double p;
void doit() {
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; ++i) {
    scanf("%s", s);
    if (s[0] != '?') {
      a[i] = atoi(s);
      vis[i] = 1;
    }
  }
  for (int i = 1; i <= m; ++i) {
    a[n + i] = 1001000000;
    vis[n + i] = 1;
  }
  n += m;
  long long ans = 0;
  for (int i = 1; i <= m; ++i) {
    int last = -1001000000, ff, t = 0;
    for (int j = i; j <= n; j += m)
      if (vis[j]) {
        if (a[j] - last <= t) {
          printf("Incorrect sequence\n");
          return;
        }
        if (!t) {
          last = a[j];
          continue;
        }
        if (last <= 0 && a[j] >= 0) {
          if (last < 0 && a[j] > 0) t--;
          if (!t) {
            for (int k = ff; k < j; k += m) a[k] = 0;
            last = a[j];
            continue;
          }
          int k1 = max(0, last + 1), k2 = 0;
          while (t) {
            if (k2 + 1 < a[j]) k2++, t--;
            if (!t) break;
            if (k1 - 1 > last) k1--, t--;
          }
          last = k1 - 1;
          for (int k = ff; k < j; k += m) a[k] = ++last;
          last = a[j];
        } else if (last > 0) {
          for (int k = ff; k < j; k += m) a[k] = ++last;
          last = a[j];
          t = 0;
        } else {
          last = a[j];
          for (int k = j - m; k >= ff; k -= m) a[k] = --last;
          last = a[j];
          t = 0;
        }
      } else {
        t++;
        if (t == 1) ff = j;
      }
  }
  n -= m;
  for (int i = 1; i <= n - 1; ++i) printf("%d ", a[i]);
  printf("%d\n", a[n]);
}
int main() {
  while (scanf("%d%d", &n, &m) != EOF) doit();
}
