#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;
}
