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 long long LINF = (long long)1e18;
const int INF = (int)1e9 + 7;
const int N = (int)1e6 + 7;
const double EPS = (double)1e-9;
const double PI = (double)3.14159265359;
const int MODULO[6] = {INF,        1000019677, 1000019393,
                       1000007521, 1000024073, 1000009667};
const int PF[5] = {77, 31, 98, 45, 67};
const int nx[4] = {0, 0, 1, -1};
const int ny[4] = {1, -1, 0, 0};
inline bool eq(const long double &a, const long double &b) {
  return fabs(a - b) < EPS;
}
int n, k;
string a[N];
int b[N];
long long second[N];
inline int to_int(const string &x) {
  int ret = 0;
  for (int i = (x[0] == '-' ? 1 : 0); i < x.size(); i++)
    ret = ret * 10 + (x[i] - 48);
  if (x[0] == '-') ret *= -1;
  return ret;
}
inline string str(int x) {
  bool neg = (x < 0);
  x = abs(x);
  string st = "";
  while (x) {
    st += (x % 10) + '0';
    ;
    x /= 10;
  }
  if (neg) st += "-";
  reverse(st.begin(), st.end());
  return st;
}
inline bool impossible() {
  for (int i = 1; i <= n; i++) second[i] = second[i - 1] + b[i];
  vector<long long> all;
  for (int i = 1; i + k - 1 <= n; i++)
    all.push_back(second[i + k - 1] - second[i - 1]);
  for (int i = 0; i + 1 < all.size(); i++)
    if (all[i] >= all[i + 1]) return true;
  return false;
}
inline void update(int l, int r) {
  int mn = (l > k ? b[l - k] + 1 : -2 * INF),
      mx = (r + k <= n ? b[r + k] - 1 : 2 * INF);
  int sz = (r - l) / k + 1;
  if (mn <= -(sz / 2) && sz / 2 <= mx) {
    sz = -(sz / 2);
    for (int i = l; i <= r; i += k) b[i] = sz++;
  } else {
    long long fi = 0ll, se = 0ll;
    for (int i = r; i >= l; i -= k) fi += abs(mx - (i - r) / k);
    for (int i = l; i <= r; i += k) se += abs(mn + (i - l) / k);
    if (fi < se)
      for (int i = r; i >= l; i -= k) b[i] = mx - (i - r) / k;
    else
      for (int i = l; i <= r; i += k) b[i] = mn + (i - l) / k;
  }
}
int main() {
  srand(time(NULL));
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] == "?") {
      if (i > k)
        b[i] = b[i - k] + 1;
      else
        b[i] = -INF;
    } else
      b[i] = to_int(a[i]);
  }
  for (int i = 1; i <= k; i++) {
    vector<int> id;
    for (int j = i; j <= n; j += k) id.push_back(j);
    int last = (a[i] == "?" ? i : INF);
    for (auto it : id) {
      if (a[it] != "?") {
        if (last <= it - k) update(last, it - k);
        last = it + k;
      }
    }
    if (a[id.back()] == "?") {
      if (last <= id.back()) update(last, id.back());
    }
  }
  if (impossible()) {
    cout << "Incorrect sequence";
    return 0;
  }
  for (int i = 1; i <= n; i++) cout << b[i] << ' ';
  return 0;
}
