#include <bits/stdc++.h>
const double EPS = 1e-9;
const double PI = acos(-1.0);
const long long INF = 1070000000LL;
const long long MOD = 1000000007LL;
using namespace std;
int n, k;
vector<long long> v[100010];
vector<long long> val[100010];
int curs[100010];
void fail() {
  cout << "Incorrect sequence" << endl;
  exit(0);
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    string s;
    cin >> s;
    if (s[0] == '?')
      v[i % k].push_back(INF);
    else {
      istringstream is(s);
      int a;
      is >> a;
      v[i % k].push_back(a);
    }
  }
  for (long long ind = (long long)(0); ind < (long long)(k); ind++) {
    vector<long long> fixed;
    vector<long long> q(1);
    for (long long i = (long long)(0);
         i < (long long)(((long long)(v[ind]).size())); i++) {
      if (v[ind][i] != INF) {
        fixed.push_back(v[ind][i]);
        q.push_back(0);
      } else {
        q.back()++;
      }
    }
    if (((long long)(fixed).size()) == 0) {
      int from = -((q[0] - 1) / 2);
      for (long long i = (long long)(from); i < (long long)(from + q[0]); i++) {
        val[ind].push_back(i);
      }
    } else {
      for (long long i = (long long)(0);
           i < (long long)(((long long)(fixed).size()) - 1); i++) {
        if (fixed[i] >= fixed[i + 1]) fail();
      }
      for (long long i = (long long)(0);
           i < (long long)(((long long)(q).size())); i++) {
        vector<long long> add;
        if (q[i] == 0) continue;
        if (i == 0) {
          int from = min(fixed[0] - 1, 0LL);
          add.push_back(from);
          int dif = 1;
          int dir = +1;
          while (((long long)(add).size()) < q[i]) {
            int cur = from + dif * dir;
            if (cur < fixed[0]) {
              add.push_back(cur);
            }
            if (dir == +1)
              dir = -1;
            else
              dir = +1, dif++;
          }
        } else if (i == ((long long)(q).size()) - 1) {
          int from = max(fixed.back() + 1, 0LL);
          add.push_back(from);
          int dif = 1;
          int dir = +1;
          while (((long long)(add).size()) < q[i]) {
            int cur = from + dif * dir;
            if (cur > fixed.back()) {
              add.push_back(cur);
            }
            if (dir == +1)
              dir = -1;
            else
              dir = +1, dif++;
          }
        } else {
          int L = fixed[i - 1] + 1, R = fixed[i] - 1;
          if (!(L <= R)) fail();
          int from = min(R, max(L, 0));
          add.push_back(from);
          int dif = 1;
          int dir = +1;
          int failcombo = 0;
          while (((long long)(add).size()) < q[i]) {
            int cur = from + dif * dir;
            if (L <= cur && cur <= R) {
              add.push_back(cur);
              failcombo = 0;
            } else {
              failcombo++;
              if (failcombo == 2) fail();
            }
            if (dir == +1)
              dir = -1;
            else
              dir = +1, dif++;
          }
        }
        sort((add).begin(), (add).end());
        for (long long j = (long long)(0);
             j < (long long)(((long long)(add).size())); j++)
          val[ind].push_back(add[j]);
      }
    }
  }
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    if (v[i % k][i / k] != INF)
      cout << v[i % k][i / k] << " ";
    else {
      cout << val[i % k][curs[i % k]++] << " ";
    }
  }
  cout << endl;
}
