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;
int n, k;
const int N = 110000;
const int inf = 1e9;
int a[N];
int b[N];
int m;
int read() {
  char p = getchar();
  while (p != '?' && p != '-' && (!(p <= '9' && p >= '0'))) p = getchar();
  if (p == '?') return inf + 1;
  int sign = 1;
  if (p == '-') {
    sign = -1;
    p = getchar();
  }
  int x = 0;
  while (p <= '9' && p >= '0') {
    x *= 10;
    x += p - 48;
    p = getchar();
  }
  return x * sign;
}
void fail() {
  printf("Incorrect sequence");
  exit(0);
}
void work() {
  int lst = -inf - 1;
  for (int i = (1); i <= (int)m; i++)
    if (b[i] <= inf) {
      if (b[i] <= lst) fail();
      lst = b[i];
    }
  b[0] = -inf - 1;
  b[m + 1] = inf + 1;
  for (int i = 1; i <= m; i++)
    if (b[i] > inf) {
      int j = i;
      while (j < m && b[j + 1] > inf) j++;
      int mid = (i + j) / 2;
      int r, l;
      if (i == 1)
        l = -inf - 1000086;
      else
        l = b[i - 1] + 1;
      if (j == m)
        r = inf + 1000086;
      else
        r = b[j + 1] - 1;
      if (r - l < j - i) fail();
      l += mid - i;
      r -= j - mid;
      if (r <= 0) {
        int gt = r - (mid - i);
        for (int k = (i); k <= (int)j; k++) {
          b[k] = gt;
          gt++;
        }
      } else if (l >= 0) {
        int gt = l - (mid - i);
        for (int k = (i); k <= (int)j; k++) {
          b[k] = gt;
          gt++;
        }
      } else {
        int gt = 0 - (mid - i);
        for (int k = (i); k <= (int)j; k++) {
          b[k] = gt;
          gt++;
        }
      }
      i = j;
    }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = (1); i <= (int)n; i++) a[i] = read();
  for (int i = (0); i <= (int)k - 1; i++) {
    m = 0;
    for (int j = i; j <= n; j += k)
      if (j > 0 && j <= n) b[++m] = a[j];
    work();
    m = 0;
    for (int j = i; j <= n; j += k)
      if (j > 0 && j <= n) a[j] = b[++m];
  }
  for (int i = (1); i <= (int)n; i++) printf("%d ", a[i]);
  return 0;
}
