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 read_int() {
  char c;
  int res = 0, signal = 1;
  do c = getchar();
  while (c == ' ' or c == '\n');
  if (c == '?') return 1000000001;
  if (c == '-') {
    signal = -1;
    c = getchar();
  }
  do {
    res = res * 10 + c - '0';
    c = getchar();
  } while (c != ' ' and c != '\n');
  return res * signal;
}
int main() {
  int n, k, array[100000];
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) array[i] = read_int();
  bool impossible = false;
  for (int j = 0; j < k; j++)
    for (int i = j; i < n; i += k) {
      if (array[i] != 1000000001) {
        if (i > j and array[i] <= array[i - k]) impossible = true;
        continue;
      }
      int last = i;
      do last += k;
      while (last <= n and array[last] == 1000000001);
      if (i == j and last >= n) {
        int mid = (last - i) / k / 2;
        int val = last / k - mid;
        for (int p = last - k; p >= i; p -= k) array[p] = --val;
      } else if (i == j) {
        int mid = (i + last) / 2;
        if (n > 1000) mid = (last - i) / 2;
        int val = min(last / k - mid / k, array[last]);
        for (int p = last - k; p >= i; p -= k) array[p] = --val;
      } else if (last >= n) {
        int mid = (last - i - k) / k / 2;
        int val = max(-mid, array[i - k] + 1);
        for (int p = i; p < last; p += k) array[p] = val++;
      } else {
        if (array[last] - array[i - k] <= (last - i) / k)
          impossible = true;
        else if (abs(array[last]) < abs(array[i - k])) {
          int mid = (i + last) / 2;
          if (n > 1000) mid = (last - i) / 2;
          int val = min(last / k - mid / k, array[last]);
          for (int p = last - k; p >= i; p -= k) array[p] = --val;
        } else {
          int mid = (last - i - k) / k / 2;
          int val = max(-mid, array[i - k] + 1);
          for (int p = i; p < last; p += k) array[p] = val++;
        }
      }
      i = last - k;
    }
  if (impossible)
    printf("Incorrect sequence\n");
  else {
    printf("%d", array[0]);
    for (int i = 1; i < n; i++) printf(" %d", array[i]);
    printf("\n");
  }
  return 0;
}
