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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rnd(long long l, long long r) { return l + rng() % (r - l + 1); }
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}
const long long N = 1e5 + 10;
long long a[N], n, k;
void GGWP() {
  cout << "Incorrect sequence";
  exit(0);
}
void solve(long long st) {
  vector<tuple<long long, long long, long long, long long>> v;
  long long l, r, lval = -1e9, rval, max_pos, last = -1e9 - 1;
  max_pos = st + ((n - st) / k) * k;
  for (long long i = st; i <= n; i += k) {
    if (a[i] == 1e10) {
      l = i;
      while (a[i] == 1e10 && i <= n) {
        r = i;
        i += k;
      }
      if (l == st)
        lval = -2e9;
      else
        lval = a[l - k] + 1;
      if (r == max_pos)
        rval = 2e9;
      else
        rval = a[r + k] - 1;
      v.push_back(make_tuple(l, r, lval, rval));
    } else {
      if (a[i] <= last) GGWP();
      last = a[i];
    }
  }
  for (auto& tmp : v) {
    tie(l, r, lval, rval) = tmp;
    if (rval - lval + 1 < (r - l) / k + 1) GGWP();
    if (lval >= 0)
      for (long long i = l; i <= r; i += k) a[i] = lval++;
    else if (rval <= 0)
      for (long long i = r; i >= l; i -= k) a[i] = rval--;
    else {
      long long l_val = -(((r - l) / k + 1) / 2);
      long long r_val = ((r - l) / k + 1) + l_val - 1;
      if (l_val < lval)
        l_val = lval;
      else if (rval < r_val)
        l_val -= (r_val - rval);
      for (long long i = l; i <= r; i += k) a[i] = l_val++;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  ;
  cin >> n >> k;
  for (long long i = 1, _c = n; i <= _c; ++i) {
    string s;
    cin >> s;
    if (s == "?")
      a[i] = 1e10;
    else
      a[i] = stoi(s);
  }
  for (long long i = 1, _c = k; i <= _c; ++i) solve(i);
  for (long long i = 1, _c = n; i <= _c; ++i) cout << a[i] << " ";
}
