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;
char o;
int read(int &x) {
  while (o = getchar(), o < '0' || o > '9')
    ;
  x = o ^ 48;
  while (o = getchar(), o >= '0' && o <= '9')
    x = (x << 3) + (x << 1) + (o ^ 48);
}
const int L = 200005;
int n, k;
int a[L], b[L];
char s[20];
void init(void) {
  cin >> n >> k;
  for (register int i = 1; i <= n; ++i) {
    scanf("%s", s);
    if (s[0] == '?') {
      b[i] = 1;
      continue;
    }
    sscanf(s, "%d", &a[i]);
  }
  for (int i = 1; i + k <= n; i++)
    if (!b[i] && !b[i + k] && a[i] >= a[i + k]) {
      printf("Incorrect sequence\n");
      exit(0);
    }
}
void work(void) {
  for (register int j = 1; j <= k; ++j) {
    int last, num, cc = 0;
    if (b[j])
      num = -(int)1e9 - 1, last = j, ++cc;
    else
      num = a[j], last = j + k;
    int i;
    for (i = j + k; i <= n; i += k)
      if (b[i])
        ++cc;
      else {
        if (!(last <= i - k)) {
          num = a[i], last = i + k;
          continue;
        }
        if (num >= a[i] || (i - k - last) / k + 1 > a[i] - num - 1) {
          printf("Incorrect sequence\n");
          exit(0);
        }
        if (num >= 0) {
          for (int l = last; l < i; l += k) a[l] = ++num;
          num = a[i];
        } else if (a[i] <= 0) {
          num = a[i];
          for (int l = i - k; l >= last; l -= k) a[l] = --num;
          num = a[i];
        } else {
          if (cc & 1) {
            int tmp = cc / 2;
            if (tmp >= a[i]) {
              num = a[i];
              for (int l = i - k; l >= last; l -= k) a[l] = --num;
            } else if (-tmp <= num) {
              for (int l = last; l < i; l += k) a[l] = ++num;
            } else {
              for (int l = i - k; l >= last; l -= k) a[l] = tmp--;
            }
          } else {
            int tmp = cc / 2 - 1;
            if (tmp >= a[i]) {
              num = a[i];
              for (int l = i - k; l >= last; l -= k) a[l] = --num;
            } else if (-tmp - 1 <= num) {
              for (int l = last; l < i; l += k) a[l] = ++num;
            } else {
              for (int l = i - k; l >= last; l -= k) a[l] = tmp--;
            }
          }
        }
        cc = 0, num = a[i], last = i + k;
      }
    if (b[i - k]) {
      a[i] = (int)1e9 + 1;
      if (!(last <= i - k)) {
        num = a[i], last = i + k;
        continue;
      }
      if (num >= a[i] || (i - k - last) / k + 1 > a[i] - num - 1) {
        printf("Incorrect sequence\n");
        exit(0);
      }
      if (num >= 0) {
        for (int l = last; l < i; l += k) a[l] = ++num;
        num = a[i];
      } else if (a[i] <= 0) {
        num = a[i];
        for (int l = i - k; l >= last; l -= k) a[l] = --num;
        num = a[i];
      } else {
        if (cc & 1) {
          int tmp = cc / 2;
          if (tmp >= a[i]) {
            num = a[i];
            for (int l = i - k; l >= last; l -= k) a[l] = --num;
          } else if (-tmp <= num) {
            for (int l = last; l < i; l += k) a[l] = ++num;
          } else {
            for (int l = i - k; l >= last; l -= k) a[l] = tmp--;
          }
        } else {
          int tmp = cc / 2 - 1;
          if (tmp >= a[i]) {
            num = a[i];
            for (int l = i - k; l >= last; l -= k) a[l] = --num;
          } else if (-tmp - 1 <= num) {
            for (int l = last; l < i; l += k) a[l] = ++num;
          } else {
            for (int l = i - k; l >= last; l -= k) a[l] = tmp--;
          }
        }
      }
    }
  }
  for (register int i = 1; i <= n; ++i)
    printf("%d%c", a[i], i == n ? '\n' : ' ');
}
int main(void) {
  init(), work();
  return 0;
}
