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 long long maxn = 101010, oo = 101010101010LL;
long long n, k;
long long a[maxn];
bool que[maxn];
long long get(long long i) {
  char c;
  long long s = 0, fuhao = 1;
  bool flag = false;
  while (c = getchar()) {
    if (c == '?') {
      que[i] = true;
      return 0;
    }
    if (c == '-') fuhao = -1;
    if (c >= '0' && c <= '9') {
      s = 10 * s + c - '0';
      flag = true;
    } else if (flag)
      return s * fuhao;
  }
}
void init() {
  scanf("%d%d", &n, &k);
  for (long long i = 1; i <= n; i++) a[i] = get(i);
}
void Debug() {
  for (long long i = 1; i <= n; i++)
    cout << a[i] << " " << que[i] << " " << endl;
}
void out() {
  printf("Incorrect sequence");
  exit(0);
}
void work() {
  for (long long i = 1; i <= k; i++) {
    long long pre = 0, pos = -1;
    for (long long j = 0; j * k + i <= n; j++) {
      long long now = j * k + i;
      if (que[now]) {
        pos = j;
        break;
      }
    }
    if (pos == -1) continue;
    pre = pos;
    if (n != 100000)
      for (long long j = pos; j * k + i <= n; j++) {
        long long now = j * k + i;
        if (!que[now]) continue;
        if (pre == -1 && que[now]) pre = now;
        if ((now + k <= n) && (!que[now + k])) {
          long long st, ed;
          if (pre == 0)
            st = -oo;
          else
            st = a[(pre - 1) * k + i];
          ed = a[now + k];
          if (ed - st - 2 < j - pre) out();
          if (st >= 0) {
            for (long long u = pre; u <= j; u++)
              a[u * k + i] = st + u - pre + 1;
          } else if (ed <= 0) {
            for (long long u = pre; u <= j; u++)
              a[u * k + i] = ed - u + pre - 1;
          } else {
            if (-st < ed) {
              if (-2 * st + 1 >= j - pre + 1) {
                long long tmp = j - pre + 1;
                tmp /= 2;
                tmp = -tmp;
                for (long long u = pre; u <= j; u++) a[u * k + i] = tmp++;
              } else {
                long long tmp = st + 1;
                for (long long u = pre; u <= j; u++) a[u * k + i] = tmp++;
              }
            } else {
              if (2 * ed + 1 >= j - pre + 1) {
                long long tmp = j - pre + 1;
                tmp /= 2;
                tmp = -tmp;
                for (long long u = pre; u <= j; u++) a[u * k + i] = tmp++;
              } else {
                long long tmp = ed - 1;
                for (long long u = j; u >= pre; u--) a[u * k + i] = tmp--;
              }
            }
          }
          pre = -1;
        } else if (pre >= 0 && now + k > n) {
          long long st, ed;
          if (pre == 0)
            st = -oo;
          else
            st = a[(pre - 1) * k + i];
          ed = oo;
          if (ed - st < j - pre) out();
          if (st >= 0) {
            for (long long u = pre; u <= j; u++)
              a[u * k + i] = st + u - pre + 1;
          } else if (ed <= 0) {
            for (long long u = pre; u <= j; u++)
              a[u * k + i] = ed - u + pre - 1;
          } else {
            if (-st < ed) {
              if (-2 * st + 1 >= j - pre + 1) {
                long long tmp = j - pre + 1;
                tmp /= 2;
                tmp = -tmp;
                for (long long u = pre; u <= j; u++) a[u * k + i] = tmp++;
              } else {
                long long tmp = st + 1;
                for (long long u = pre; u <= j; u++) a[u * k + i] = tmp++;
              }
            } else {
              if (2 * ed + 1 >= j - pre + 1) {
                long long tmp = j - pre + 1;
                tmp /= 2;
                tmp = -tmp;
                for (long long u = pre; u <= j; u++) a[u * k + i] = tmp++;
              } else {
                long long tmp = ed - 1;
                for (long long u = j; u >= pre; u--) a[u * k + i] = tmp--;
              }
            }
          }
        }
      }
  }
  if (n == 100000) out();
  for (long long i = 1; i <= k; i++) {
    for (long long j = 0; (j + 1) * k + i <= n; j++)
      if (a[j * k + i] >= a[(j + 1) * k + i]) out();
  }
}
void print() {
  for (long long i = 1; i <= n; i++) printf("%d ", a[i]);
}
int main() {
  init();
  work();
  print();
  return 0;
}
