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>
const int inf = 1 << 30;
const int N = 100010;
std::vector<int> sequence;
char buf[15];
int num[N];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%s", buf);
    int sign = 1;
    for (int j = 0; buf[j]; j++) {
      if (buf[j] == '?') {
        num[i] = inf;
        break;
      } else if (buf[j] == '-') {
        sign = -1;
      } else {
        num[i] = num[i] * 10 + (buf[j] - '0');
      }
    }
    num[i] *= sign;
  }
  int ok = 1;
  for (int i = 0; i < k; i++) {
    sequence.clear();
    for (int j = i; j < n; j += k) {
      sequence.push_back(num[j]);
    }
    int s = -1, t = -1, sz = sequence.size();
    for (int j = 0; j < sz; j++) {
      if (sequence[j] != inf) {
        s = t;
        t = j;
        int l = s != -1 ? sequence[s] : -inf, r = sequence[t];
        int d = t - s - 1;
        if (r - l - 1 < t - s - 1) ok = -1;
        if ((long long)l * r >= 0) {
          if (r <= 0) {
            for (int o = t - 1, c = 1; o > s; o--, c++) sequence[o] = r - c;
          } else {
            for (int o = s + 1, c = 1; o < t; o++, c++) sequence[o] = l + c;
          }
        } else {
          if (abs(l) <= abs(r)) {
            for (int o = s + 1, c = 0; o < t; o++, c++)
              sequence[o] = std::max(l + 1, -(d - 1) / 2) + c;
          } else {
            for (int o = t - 1, c = 0; o > s; o--, c++)
              sequence[o] = std::min(r - 1, (d - 1) / 2) - c;
          }
        }
      }
    }
    int d = sz - t - 1;
    if (t != sz - 1 && ~t) {
      for (int o = t + 1, c = 0; o < sequence.size(); o++, c++)
        sequence[o] = std::max(sequence[t] + 1, -(d - 1) / 2) + c;
    }
    if (s == -1 && t == -1) {
      for (int o = 0, c = 0; o < sz; o++, c++) sequence[o] = -(sz - 1) / 2 + c;
    }
    if (ok == -1) return puts("Incorrect sequence"), 0;
    for (int j = i; j < n; j += k) num[j] = sequence[j / k];
  }
  for (int i = 0; i < n; i++) printf("%d%c", num[i], " \n"[i == n - 1]);
  return 0;
}
