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;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
const int maxn = 100000 + 100;
const int qsign = -1000000000 - 2 - maxn;
const int smin = -1000000000 - 1 - maxn;
const int smax = 1000000000 + 1 + maxn;
int a[maxn];
bool was[maxn] = {0};
int n, k;
void do_fill(int s, int c, int v) {
  for (int i = 0; i < c; i++) {
    a[s + i * k] = v;
    v++;
    was[s + i * k] = true;
  }
}
void do_fill_r(int s, int c, int v) {
  for (int i = 0; i < c; i++) {
    a[s - i * k] = v;
    v--;
    was[s - i * k] = true;
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    if (s == "?") {
      a[i] = qsign;
    } else {
      bool minus = (s[0] == '-');
      int j = 0;
      a[i] = 0;
      if (minus) j++;
      for (; j < s.length(); j++) {
        a[i] = a[i] * 10 + s[j] - '0';
      }
      if (minus) a[i] = -a[i];
    }
  }
  for (int i = 0; i <= n - k; i++) {
    if (!was[i]) {
      int mmin = smin;
      int mmax = smax;
      vector<int> seq;
      for (int j = i; j < n; j += k) {
        seq.push_back(a[j]);
        was[j] = true;
      }
      int last = -1;
      for (int j = 0; j < seq.size(); j++) {
        if (seq[j] != qsign) {
          if (last != -1 && seq[last] >= seq[j]) {
            cout << "Incorrect sequence" << '\n';
            return 0;
          }
          last = j;
        }
      }
      int j = 0;
      while (j < seq.size()) {
        while (j < seq.size() && seq[j] != qsign) j++;
        if (j == seq.size()) continue;
        int start = j;
        int end = j;
        while (end < seq.size() && seq[end] == qsign) end++;
        j = end;
        end = end - 1;
        mmin = (start == 0) ? smin : seq[start - 1];
        mmax = (end == seq.size() - 1) ? smax : seq[end + 1];
        if (mmax - mmin - 1 < end - start + 1 || mmin >= mmax) {
          cout << "Incorrect sequence" << '\n';
          return 0;
        }
        if (mmin == smin && mmax == smax) {
          do_fill(i + start * k, end - start + 1, -(end - start + 1) / 2);
        } else {
          int initial = -(end - start + 1) / 2;
          if (initial <= mmin) initial += (mmin - initial) + 1;
          if (initial + end - start >= mmax)
            initial -= (initial + end - start - mmax) + 1;
          do_fill(i + start * k, end - start + 1, initial);
        }
      }
    }
  }
  for (int i = n - k + 1; i < n; i++) {
    if (a[i] == qsign) a[i] = 0;
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << '\n';
  return 0;
}
