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;
int n, k;
vector<int64_t> seq;
vector<bool> unknown;
int nextKnown(int i) {
  do {
    i += k;
  } while (i <= n + 1 && unknown[i]);
  return i;
}
bool tryFill(int l, int r) {
  int indexGap = (r - l) / k - 1;
  int64_t lv = (l > 0) ? seq[l] : seq[0];
  int64_t rv = (r <= n) ? seq[r] : seq[n + 1];
  int64_t valueGap = rv - lv - 1;
  if (indexGap > valueGap) return false;
  auto cost = [&](int64_t alpha) -> int64_t {
    int64_t res = 0;
    int64_t curr = lv + 1 + alpha;
    for (int i = l + k; i < r; i += k) {
      res += abs(curr);
      curr++;
    }
    return res;
  };
  auto isGood = [&](int64_t alpha) {
    return alpha >= 0 && alpha <= valueGap - indexGap;
  };
  int64_t alpha = -1;
  if (indexGap % 2 == 0) {
    int64_t testAlpha = -lv - indexGap / 2 - 1;
    if (isGood(testAlpha)) alpha = testAlpha;
    testAlpha = -lv - indexGap / 2;
    if (isGood(testAlpha)) alpha = testAlpha;
  } else {
    int64_t testAlpha = -lv - (indexGap + 1) / 2;
    if (isGood(testAlpha)) alpha = testAlpha;
  }
  if (alpha < 0) {
    auto c1 = cost(0);
    auto c2 = cost(valueGap - indexGap);
    alpha = (c1 < c2) ? 0 : valueGap - indexGap;
  }
  lv += alpha + 1;
  for (int i = l + k; i < r; i += k) {
    seq[i] = lv;
    lv++;
  }
  return true;
}
int main() {
  cin >> n >> k;
  seq.resize(n + 2);
  unknown.resize(n + 2);
  seq[0] = -1e10 - 10;
  unknown[0] = false;
  seq[n + 1] = 1e10 + 10;
  unknown[n + 1] = false;
  for (int i = 1; i <= n; ++i) {
    string s;
    cin >> s;
    if (s == "?") {
      unknown[i] = true;
      seq[i] = 17;
    } else {
      unknown[i] = false;
      seq[i] = stoll(s);
    }
  }
  bool canFill = true;
  for (int start = 1 - k; start <= 0; ++start) {
    int l = start;
    do {
      int r = nextKnown(l);
      canFill = canFill && tryFill(l, r);
      l = r;
    } while (l <= n);
  }
  if (canFill)
    for (int i = 1; i <= n; ++i) cout << seq[i] << ' ';
  else
    cout << "Incorrect sequence";
  return 0;
}
