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 int MAXN = 100010;
const int INF = 2000000000;
int n, a[MAXN], b[MAXN], sub[MAXN], tot, k;
int getint() {
  char c = getchar();
  int con = 0, f = 1;
  while (c != '-' && c != '?' && (c < '0' || c > '9')) c = getchar();
  if (c == '?') return INF;
  if (c == '-') f = -f;
  if (c == '-') c = getchar();
  while (c >= '0' && c <= '9') con = con * 10 + c - '0', c = getchar();
  return con * f;
}
int main() {
  n = getint(), k = getint();
  for (int i = 1; i <= n; i++) a[i] = getint();
  for (int T = 1; T <= k; T++) {
    tot = 0;
    for (int i = T; i <= n; i += k) b[++tot] = a[i], sub[tot] = i;
    int r = 0;
    b[0] = -INF + 1;
    b[++tot] = INF - 1;
    while (r < tot) {
      int L = b[r], l = r;
      while (b[r + 1] == INF && r + 1 <= tot) r++;
      r++;
      int R = b[r];
      if (R <= 0) {
        for (int i = r - 1; i > l; i--) b[i] = b[i + 1] - 1, a[sub[i]] = b[i];
      } else if (L >= 0) {
        for (int i = l + 1; i < r; i++) b[i] = b[i - 1] + 1, a[sub[i]] = b[i];
      } else {
        int len = r - l - 1;
        if (len != 0) b[l + 1] = -(len / 2), a[sub[l + 1]] = b[l + 1];
        for (int i = l + 2; i < r; i++) b[i] = b[i - 1] + 1, a[sub[i]] = b[i];
        if (b[r - 1] >= b[r])
          for (int i = r - 1; i > l; i--) b[i] = b[i + 1] - 1, a[sub[i]] = b[i];
        if (b[l + 1] <= b[l])
          for (int i = l + 1; i < r; i++) b[i] = b[i - 1] + 1, a[sub[i]] = b[i];
      }
    }
  }
  for (int i = 1; i <= n - k; i++)
    if (a[i] >= a[i + k]) {
      puts("Incorrect sequence");
      return 0;
    }
  for (int i = 1; i < n; i++) printf("%d ", a[i]);
  printf("%d\n", a[n]);
  return 0;
}
