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>
char str[2000010];
int arr[100010];
int dp1[100010], dp2[100010];
int n, k;
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
void gao() {
  int i, j, kk, pos, left, right;
  int start;
  int number;
  for (i = 0; i < n; i++) {
    if (i - k >= 0) {
      if (arr[i - k] != 2000000000)
        dp1[i] = i - k;
      else
        dp1[i] = dp1[i - k];
    } else
      dp1[i] = -1;
  }
  for (i = n - 1; i >= 0; i--) {
    if (i + k < n) {
      if (arr[i + k] != 2000000000)
        dp2[i] = i + k;
      else
        dp2[i] = dp2[i + k];
    } else
      dp2[i] = -1;
  }
  for (i = 0; i < n; i++)
    if (arr[i] != 2000000000) {
      pos = i, left = dp1[i], right = dp2[i];
      if (left != -1) {
        if (arr[i] < arr[left] + (pos - left) / k) goto IRR;
      }
      if (right != -1) {
        if (arr[i] > arr[right] + (right - pos) / k) goto IRR;
      }
    }
  for (kk = 0; kk < k; kk++) {
    int left_num, right_num;
    left = kk - k;
    left_num = -2000000000;
    for (i = kk; i < n; i += k)
      if (arr[i] != 2000000000) {
        right_num = arr[i];
        number = (i - left) / k - 1;
        if (number != 0) {
          if (left_num >= 0) start = left_num + 1;
          if (right_num <= 0)
            start = right_num - number;
          else {
            start = max(left_num + 1, -(number - 1) / 2);
            start = min(right_num - number, start);
          }
        }
        for (j = left + k; j < i; j += k) {
          arr[j] = start++;
        }
        left = i, left_num = arr[i];
      }
    right_num = 2000000000;
    number = (i - left) / k - 1;
    if (number != 0) {
      if (left_num >= 0) start = left_num + 1;
      if (right_num <= 0)
        start = right_num - number;
      else {
        start = max(left_num + 1, -(number - 1) / 2);
        start = min(right_num - number, start);
      }
    }
    for (j = left + k; j < i; j += k) arr[j] = start++;
  }
  for (i = 0; i < n; i++) printf("%d ", arr[i]);
  puts("");
  return;
IRR:
  puts("Incorrect sequence");
}
int main() {
  int num, sign, i, idx;
  while (~scanf("%d%d", &n, &k)) {
    getchar();
    gets(str);
    idx = 0;
    num = 0;
    sign = 1;
    for (i = 0; str[i]; i++) {
      if (str[i] == '?')
        num = 2000000000;
      else if (str[i] == ' ') {
        arr[idx++] = num * sign;
        num = 0, sign = 1;
      } else if (str[i] == '-') {
        sign = -1;
      } else {
        num = num * 10 + str[i] - '0';
      }
    }
    arr[idx++] = num * sign;
    gao();
  }
  return 0;
}
