#include <bits/stdc++.h>
using namespace std;
long long qst = (1000LL * 1000LL * 1000LL + 11LL);
long long mn = -(qst * qst / 10), mx = (qst * qst / 10);
bool putNums(vector<pair<long long, long long> > &rng1,
             vector<pair<long long, long long> > &rng2, vector<long long> &a,
             long long first, long long k) {
  long long n = (a.size() - 2);
  for (long long j = 0; j < rng1.size(); j++) {
    long long lf = rng1[j].first, rt = rng1[j].second;
    long long xx = rng2[j].first, yy = rng2[j].second;
    long long diff = rng2[j].second - rng2[j].first - 1;
    if ((diff) > (a[rt] - a[lf] - 1)) return false;
    if (a[rt] >= 0 && a[lf] >= 0) {
      assert(lf > 0);
      long long z = a[lf];
      for (long long i = lf + k; i < rt; i += k) a[i] = ++z;
    } else if (a[rt] <= 0 && a[lf] <= 0) {
      assert(rt < (n + 1));
      long long val = a[rt];
      for (long long i = rt - k; i > lf; i -= k) a[i] = --val;
    } else {
      long long x;
      if (abs(a[lf]) >= abs(a[rt])) {
        x = diff >> 1;
        x = min(x, abs(a[rt]));
        if (x == abs(a[rt])) x--;
        long long lst =
            (rt == (n + 1)) ? (first + ((n - first) / k) * k) : (rt - k);
        for (long long i = lst; i > lf; i -= k) a[i] = (x--);
      } else {
        x = diff >> 1;
        x = min(x, abs(a[lf]));
        long long val = -x;
        if (x == abs(a[lf])) val++;
        for (long long i = lf + (lf == 0 ? first : k); i < rt; i += k)
          a[i] = val++;
      }
    }
  }
  return true;
}
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n + 2, 0);
  a[0] = mn;
  a[n + 1] = mx;
  for (long long i = 0; i < (n); i++) {
    string s;
    cin >> s;
    long long p;
    if (s == "?")
      p = qst;
    else
      p = stoll(s);
    a[i + 1] = p;
  }
  for (long long i = 1; i <= k; i++) {
    vector<long long> v;
    vector<pair<long long, long long> > rng1, rng2;
    v.push_back(0);
    for (long long j = i; j <= n; j += k) {
      long long z = a[*(v.end() - 1)];
      if (z != qst && a[j] != qst && a[j] <= z) {
        cout << "Incorrect sequence";
        return 0;
      }
      v.push_back(j);
    }
    v.push_back(n + 1);
    for (long long l = 1, r = 0; l < (v.size()); l++) {
      while (a[v[++r]] == qst)
        ;
      if (l != r) {
        rng1.push_back(pair<long long, long long>(v[l - 1], v[r]));
        rng2.push_back(pair<long long, long long>(l - 1, r));
      }
      l = r;
    }
    if (!putNums(rng1, rng2, a, i, k)) {
      cout << "Incorrect sequence";
      return 0;
    }
  }
  for (long long i = 1; i < n; i++) cout << a[i] << ' ';
  cout << a[n];
  return 0;
}
