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 s[(1 << 17)];
int n, k, a[(1 << 17)];
vector<int> v[(1 << 17)];
int trans(char* s) {
  int l = strlen(s), res = 0;
  int st = s[0] == '-';
  for (int i = st; i < l; i++) res = res * 10 + s[i] - 48;
  return st ? -res : res;
}
int solve(int l, int r, int st, int ed) {
  vector<int> vt;
  if (l > r) return ed - st >= -1;
  if (st > ed) return 0;
  if (ed - st < (r - l) / k) return 0;
  int cnt = (r - l) / k + 1;
  if (st >= 0) {
    for (int i = 0; i < cnt; i++) vt.push_back(st + i);
  } else if (ed < 0) {
    for (int i = cnt - 1; i >= 0; i--) vt.push_back(ed - i);
  } else {
    vt.push_back(0);
    for (int x = -1, y = 1, i = 1; i < cnt; i++) {
      if (x < st)
        vt.push_back(y++);
      else if (y > ed)
        vt.push_back(x--);
      else {
        if (abs(x) < abs(y))
          vt.push_back(x--);
        else
          vt.push_back(y++);
      }
    }
    sort(vt.begin(), vt.end());
  }
  for (int i = l, j = 0; i <= r; i += k, j++) a[i] = vt[j];
  return 1;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    if (s[0] == '?')
      a[i] = 1010000000;
    else
      a[i] = trans(s);
  }
  for (int i = 0; i < k; i++) {
    int last = -1, j;
    for (j = i; j < n; j += k)
      if (a[j] != 1010000000) {
        if (last == -1)
          solve(i, j - k, -1010000000, a[j] - 1);
        else {
          if (!solve(last + k, j - k, a[last] + 1, a[j] - 1)) {
            puts("Incorrect sequence");
            return 0;
          }
        }
        last = j;
      }
    if (last == -1)
      solve(i, j - k, -1010000000, 1010000000);
    else
      solve(last + k, j - k, a[last] + 1, 1010000000);
  }
  for (int i = 0; i < n - 1; i++) printf("%d ", a[i]);
  printf("%d\n", a[n - 1]);
  return 0;
}
