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;
void set(int& n, int first) { n = n | (1 << first); }
void reset(int& n, int first) { n = n & ~(1 << first); }
bool check(int n, int first) { return (bool)(n & (1 << first)); }
const int mx = 100005;
int a[mx], k;
bool f[mx];
bool fun(int s, int e, int v1, int v2) {
  if (v2 <= v1) return false;
  int c = (e - s - k) / k;
  if (c > v2 - v1 - 1) return false;
  int m = -c / 2, st, i;
  if (m <= v1) {
    st = v1 + 1;
    for (i = s + k; i < e; i += k) a[i] = st++;
  } else if (m + c >= v2) {
    st = v2 - 1;
    for (i = e - k; i > s; i -= k) a[i] = st--;
  } else {
    for (i = s + k; i < e; i += k) a[i] = m++;
  }
  return true;
}
int main() {
  int i, j, n;
  while (scanf("%d%d", &n, &k) == 2) {
    memset(f, false, sizeof f);
    for (i = 1; i <= n; i++) {
      char ch, sign = '+';
      while (scanf("%c", &ch) && (ch == ' ' || ch == '\n'))
        ;
      int t = 0;
      while (true) {
        if (ch == '?') {
          f[i] = true;
          break;
        } else if (ch == '-')
          sign = '-';
        else if (ch == ' ' || ch == '\n')
          break;
        else
          t = t * 10 + ch - '0';
        scanf("%c", &ch);
      }
      if (sign == '-') t = -t;
      a[i] = t;
    }
    int s = -k, e = 0;
    a[0] = -2e9;
    bool flag = false;
    for (i = 1; i <= k; i++) {
      int v1 = -1e9 - 1e6, t = 0;
      s = i - k;
      for (j = i; j <= n; j += k) {
        if (f[j])
          t++;
        else if (s >= i && j > i && a[j] <= a[s])
          flag = true;
        else {
          if (t > 0 && (!fun(s, j, v1, a[j]))) flag = true;
          t = 0;
          s = j;
          v1 = a[j];
        }
        if (flag) break;
      }
      if (s < n) {
        if (!fun(s, j, v1, 1e9 + 1e6))
          ;
      }
      if (flag) break;
    }
    if (flag)
      printf("Incorrect sequence\n");
    else {
      for (i = 1; i <= n; i++) {
        if (i > 1) printf(" ");
        printf("%d", a[i]);
      }
      printf("\n");
    }
  }
}
