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 N = 100005;
const int inf = 1000000007;
char num[22];
int a[N];
bool can = true;
void solve(int prev, int current, int i, int j, const vector<int> &positions) {
  if (j - i - 1 > (long long)current - prev - 1) {
    can = false;
  }
  if (j - i - 1 <= 0) {
    return;
  }
  int cant = j - i - 1;
  int ri = cant / 2;
  int le = ri - cant + 1;
  if (prev < le && ri < current) {
    for (int pos = i + 1; pos < j; pos++) {
      a[positions[pos]] = le++;
    }
  } else {
    long long left = 0, right = 0;
    int v = prev + 1;
    for (int rep = 0; rep < cant; rep++) {
      left += abs(v);
      v++;
    }
    v = current - 1;
    for (int rep = 0; rep < cant; rep++) {
      right += abs(v);
      v--;
    }
    if (left < right) {
      v = prev + 1;
      for (int pos = i + 1; pos < j; pos++) {
        a[positions[pos]] = v;
        v++;
      }
    } else {
      v = current - 1;
      for (int pos = j - 1; pos > i; pos--) {
        a[positions[pos]] = v;
        v--;
      }
    }
  }
}
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%s", num);
    if (num[0] == '?') {
      a[i] = inf;
    } else {
      int len = strlen(num);
      int ini = 0;
      if (num[0] == '-') {
        ini = 1;
      }
      int val = 0;
      for (int pos = ini; pos < len; ++pos) {
        val = val * 10 + num[pos] - '0';
      }
      if (num[0] == '-') {
        val = -val;
      }
      a[i] = val;
    }
  }
  for (int ini = 0; ini < k; ini++) {
    vector<int> positions;
    for (int i = ini; i < n; i += k) {
      positions.push_back(i);
    }
    int prev_val = -2 * inf;
    int prev_pos = -1;
    for (int i = 0; i < positions.size(); ++i) {
      int where = positions[i];
      if (a[where] != inf) {
        solve(prev_val, a[where], prev_pos, i, positions);
        prev_val = a[where];
        prev_pos = i;
      }
    }
    solve(prev_val, 2 * inf, prev_pos, positions.size(), positions);
  }
  if (!can) {
    puts("Incorrect sequence");
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    printf("%d ", a[i]);
  }
  return 0;
}
