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;
long long q[2 * 100010];
int head, tail;
vector<int> b;
long long a[100010];
int n, k;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    char s[12];
    scanf("%s", s);
    if (s[0] == '?')
      a[i] = 1e18;
    else if (s[0] == '-') {
      a[i] = 0;
      for (int j = 1; j < strlen(s); j++) a[i] = a[i] * 10 - (s[j] - '0');
    } else {
      a[i] = 0;
      for (int j = 0; j < strlen(s); j++) a[i] = a[i] * 10 + (s[j] - '0');
    }
  }
  for (int i = 0; i < n; i++) {
    if (a[i] == 1e18) {
      long long down, up;
      b.clear();
      int j = i;
      b.push_back(i);
      while (j + k < n && a[j + k] == 1e18) {
        b.push_back(j + k);
        j += k;
      }
      if (i - k >= 0)
        down = a[i - k];
      else
        down = -1e18;
      if (j + k < n)
        up = a[j + k];
      else
        up = 1e18;
      head = tail = 0;
      for (int p = -b.size() + 1; p <= 0; p++) q[tail++] = p;
      while (abs(q[head]) > q[tail - 1] + 1) {
        head++;
        q[tail] = q[tail - 1] + 1;
        tail++;
      }
      if (down >= q[head]) {
        for (int p = 0; p < b.size(); p++) a[b[p]] = down + p + 1;
      } else if (up <= q[tail - 1]) {
        for (int p = 0; p < b.size(); p++)
          a[b[p]] = (long long)(up - b.size() + p);
      } else {
        for (int p = 0; p < b.size(); p++) a[b[p]] = q[p + head];
      }
    }
  }
  int flag = 1;
  for (int i = 0; i < n; i++) {
    if (i + k < n && a[i + k] <= a[i]) {
      flag = 0;
      break;
    }
  }
  if (flag) {
    printf("%d", a[0]);
    for (int i = 1; i < n; i++) printf(" %d", a[i]);
    printf("\n");
  } else
    printf("Incorrect sequence\n");
  return 0;
}
