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 = 101010;
const int INF = 1000110001;
int n, k, l, a[MAXN], b[MAXN];
bool fix[MAXN], visited[MAXN];
int getInt(char str[]) {
  int len = strlen(str), num = 0, j = 0;
  if (str[0] == '-') j = 1;
  for (int i = j; i < len; i++) num = num * 10 + str[i] - '0';
  if (j == 1) num = -num;
  return num;
}
void read() {
  scanf("%d%d", &n, &k);
  memset(fix, false, sizeof(fix));
  char str[12];
  for (int i = 0; i < n; i++) {
    scanf("%s", str);
    if (str[0] != '?') {
      a[i] = getInt(str);
      fix[i] = true;
    }
  }
}
bool getOptimal(int lower, int upper) {
  if (upper - lower - 1 < l) return false;
  if (lower >= 0) {
    a[b[0]] = lower + 1;
    for (int i = 1; i < l; i++) a[b[i]] = a[b[i - 1]] + 1;
  } else if (upper <= 0) {
    a[b[l - 1]] = upper - 1;
    for (int i = l - 2; i >= 0; i--) a[b[i]] = a[b[i + 1]] - 1;
  } else {
    int len = l / 2;
    if (-lower > len && upper > len) {
      a[b[len]] = 0;
      for (int i = len - 1; i >= 0; i--) a[b[i]] = a[b[i + 1]] - 1;
      for (int i = len + 1; i < l; i++) a[b[i]] = a[b[i - 1]] + 1;
    } else if (-lower > len) {
      a[b[l - 1]] = upper - 1;
      for (int i = l - 2; i >= 0; i--) a[b[i]] = a[b[i + 1]] - 1;
    } else {
      a[b[0]] = lower + 1;
      for (int i = 1; i < l; i++) a[b[i]] = a[b[i - 1]] + 1;
    }
  }
  return true;
}
bool solve() {
  int lower = -INF, upper = INF;
  memset(visited, false, sizeof(visited));
  for (int i = 0; i < n; i++)
    if (!visited[i]) {
      lower = -INF;
      upper = INF;
      l = 0;
      for (int j = i; j < n; j += k) {
        visited[j] = true;
        if (fix[j]) {
          if (a[j] <= lower) return false;
          if (l == 0) {
            lower = a[j];
          } else {
            upper = a[j];
            if (!getOptimal(lower, upper)) return false;
            l = 0;
            lower = a[j];
            upper = INF;
          }
        } else {
          b[l++] = j;
        }
      }
      if (l > 0)
        if (!getOptimal(lower, upper)) return false;
    }
  return true;
}
int main() {
  read();
  if (!solve())
    puts("Incorrect sequence");
  else {
    for (int i = 0; i < n - 1; i++) printf("%d ", a[i]);
    printf("%d\n", a[n - 1]);
  }
  return 0;
}
