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>
int main() {
  int n, k, i;
  long long a[200003];
  unsigned short q[200003];
  scanf("%d%d", &n, &k);
  for (i = 0; i < n; i++) (q[i] = !scanf("%I64d", &a[i])) ? getchar() : 0;
  unsigned short incorrect = 0;
  for (i = 0; i < k; i++) {
    long long last1 = -0x100ffeea900dc0deL, last2, j1 = i - k, j2, a1, a2, ii;
    while ((j1 += k) < n)
      if (!q[j1]) {
        last2 = last1;
        last1 = a[j1];
        if (last2 >= last1) {
          incorrect = 1;
          break;
        }
      }
    if (incorrect) break;
    j1 = i;
    while (j1 < n - k) {
      while (j1 < n && !q[j1]) j1 += k;
      a1 = j1 < k ? -0x100ffeea900dc0deL : a[j1 - k];
      j2 = j1;
      while (j2 < n && q[j2]) j2 += k;
      if (j2 <= j1) break;
      a2 = j2 >= n ? 0x100ffeea900dc0deL : a[j2];
      if (a2 - a1 - 1 < (j2 - j1) / k) {
        incorrect = 1;
        break;
      }
      if (a1 >= 0 && a2 >= 0) {
        a[j1] = a1 + 1;
        for (ii = j1 + k; ii < j2; ii += k) a[ii] = a[ii - k] + 1;
      } else if (a1 <= 0 && a2 <= 0) {
        a[j2 - k] = a2 - 1;
        for (ii = j2 - k - k; ii >= j1; ii -= k) a[ii] = a[ii + k] - 1;
      } else {
        long long len = (j2 - j1) / k, begin = -len / 2;
        if (begin <= a1)
          begin = a1 + 1;
        else if (begin > a2 - len)
          begin = a2 - len;
        a[j1] = begin;
        for (ii = j1 + k; ii < j2; ii += k) a[ii] = a[ii - k] + 1;
      }
      j1 = j2;
    }
    if (incorrect) break;
  }
  if (incorrect)
    printf("Incorrect sequence\n");
  else {
    for (i = 0; i < n; i++) printf("%I64d ", a[i]);
    putchar('\n');
  }
  return 0;
}
