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 ch[15];
bool flag[100000 + 10];
int n, k, tot;
long long a[100000 + 10], L, R;
int _work() {
  bool f(0);
  int s(0), h(0);
  if (ch[0] == '-') f = 1, h++;
  for (; ch[h]; h++) {
    s *= 10;
    s += ch[h] - '0';
  }
  if (f) s = -s;
  return s;
}
bool work(int now, int tot, long long L, long long R) {
  int right(now + tot - 1);
  if (R - L + 1 < tot) return false;
  if (L * R >= 0)
    if (L >= 0)
      for (int i = now; i <= right; i++) a[i] = L++;
    else
      for (int i = right; i >= now; i--) a[i] = R--;
  else if (L > -(tot >> 1))
    for (int i = now; i <= right; i++) a[i] = L++;
  else if (R < (tot >> 1))
    for (int i = right; i >= now; i--) a[i] = R--;
  else {
    L = -(tot >> 1);
    for (int i = now; i <= right; i++) a[i] = L++;
  }
  return true;
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> ch;
    if (ch[0] == '?') {
      flag[i] = 1;
      continue;
    }
    a[i] = _work();
  }
  for (int i = 1; i <= k; i++) {
    for (int j = i; j <= n; j += k) {
      tot = 1;
      int now = j;
      if (flag[now]) {
        do {
          j += k, tot++;
        } while (flag[j] && j <= n);
        j -= k, tot--;
        L = (now <= k) ? -(1LL << 30) : a[now - k] + 1;
        R = (j > n - k) ? (1LL << 30) : a[j + k] - 1;
        if (!work(now, tot, L, R)) {
          printf("Incorrect sequence");
          return 0;
        }
      } else {
        L = (j <= k) ? -(1LL << 30) : a[j - k] + 1;
        R = (j > n - k && !flag[j + k]) ? (1LL << 30) : a[j + k] - 1;
        if (a[j] < L || a[j] > R) {
          printf("Incorrect sequence");
          return 0;
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) printf("%I64d ", a[i]);
}
