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;
const int inf = 0x3f3f3f3f;
int a[400001];
pair<int, int> stack[400001];
int n, k;
char str[1001];
bool ok = false;
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%s", str);
    if (str[0] == '?')
      a[i] = inf;
    else {
      int now = 0;
      int len = strlen(str);
      if (str[0] == '-') now = 1;
      int sum = 0;
      for (int j = now; j < len; j++) sum = sum * 10 + str[j] - '0';
      if (str[0] == '-') sum = -sum;
      a[i] = sum;
    }
  }
  for (int i = 1; i <= k; i++) {
    int top = 0;
    for (int j = i; j <= n; j += k) stack[++top] = make_pair(a[j], j);
    for (int j = 1; j <= top; j++) {
      if (stack[j].first == inf) continue;
      int tmp = j;
      while (tmp <= top && stack[tmp].first != inf) ++tmp;
      --tmp;
      if (tmp == j) continue;
      for (int p = j; p < tmp; p++)
        if (stack[p].first >= stack[p + 1].first) ok = true;
      if (ok == true) break;
      j = tmp;
    }
    if (ok) break;
    for (int j = 1; j <= top; j++) {
      if (stack[j].first != inf) continue;
      int tmp = j;
      while (tmp <= top && stack[tmp].first == inf) ++tmp;
      int L = j == 1 ? -inf : stack[j - 1].first + 1;
      int R = tmp == top + 1 ? inf : stack[tmp].first - 1;
      --tmp;
      int size = tmp - j + 1;
      if (R - L + 1 < size) {
        ok = true;
        break;
      }
      if (-(size / 2) >= L && ((size - 1) / 2) <= R) {
        for (int p = j; p <= tmp; p++) a[stack[p].second] = p - j - (size / 2);
      } else if (-((size - 1) / 2) >= L && (size / 2) <= R) {
        for (int p = j; p <= tmp; p++)
          a[stack[p].second] = p - j - ((size - 1) / 2);
      } else {
        int ans1 = 0, ans2 = 0;
        for (int p = R - size + 1; p <= R; p++) ans1 += abs(p);
        for (int p = L; p <= L + size - 1; p++) ans2 += abs(p);
        if (ans1 < ans2) {
          for (int p = j; p <= tmp; p++) a[stack[p].second] = p - tmp + R;
        } else {
          for (int p = j; p <= tmp; p++) a[stack[p].second] = p - j + L;
        }
      }
      j = tmp;
    }
    if (ok) break;
  }
  if (ok)
    printf("Incorrect sequence\n");
  else {
    for (int i = 1; i <= n; i++) printf("%d ", a[i]);
    printf("\n");
  }
  return 0;
}
