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;
long n, k;
string st;
vector<pair<long, long> > v[1 << 20];
long q;
vector<pair<long, long> > block;
long l1;
vector<long> tv;
long er;
long ans[1 << 20];
vector<long> solve(vector<pair<long, long> > v, long lwr, long upr) {
  long sz = v.size();
  if (lwr + sz >= upr) er = 1;
  vector<long> res;
  res.resize(v.size());
  if (er) return res;
  if (upr <= sz - 1 - sz / 2) {
    for (int i = 0; i < v.size(); i++) res[i] = upr - sz + i;
    return res;
  }
  if (lwr >= -(sz / 2)) {
    for (int i = 0; i < v.size(); i++) {
      res[i] = lwr + i + 1;
    }
    return res;
  }
  for (int i = 0; i < v.size(); i++) res[i] = i - sz / 2;
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> st;
    if (st == "?") {
      v[i % k].push_back(make_pair(i, -2000000000));
    } else {
      stringstream s(st);
      s >> q;
      v[i % k].push_back(make_pair(i, q));
    }
  }
  for (int i = 0; i < k; i++) {
    block.clear();
    l1 = -1100000001;
    for (int j = 0; j < v[i].size(); j++) {
      if (v[i][j].second > -1.5e9) {
        if (block.size()) {
          tv = solve(block, l1, v[i][j].second);
          for (int q = 0; q < tv.size(); q++)
            v[i][j - tv.size() + q].second = tv[q];
        }
        block.clear();
        if (j > 0 && v[i][j].second <= v[i][j - 1].second) er = 1;
        l1 = v[i][j].second;
      } else {
        block.push_back(v[i][j]);
      }
    }
    if (block.size()) {
      tv = solve(block, l1, 1100000001);
      for (int j = 0; j < tv.size(); j++)
        v[i][v[i].size() - tv.size() + j].second = tv[j];
    }
  }
  if (er)
    cout << "Incorrect sequence" << endl;
  else {
    for (int i = 0; i < k; i++)
      for (int j = 0; j < v[i].size(); j++) ans[v[i][j].first] = v[i][j].second;
    for (int i = 1; i <= n; i++) {
      if (i > 1) cout << " ";
      cout << ans[i];
    }
    cout << endl;
  }
  cin.get();
  cin.get();
  return 0;
}
