#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
int n, k;
string s[300005];
long long strToll(string s) {
  int fl = 0;
  if (s[0] == '-') fl = 1;
  long long tmp = 0;
  for (int i = fl; i < ((int)(s).size()); ++i) {
    tmp *= 10;
    tmp += (long long)(s[i] - '0');
  }
  if (fl) tmp *= -1;
  return tmp;
}
string llToString(long long x) {
  long long fl = 0;
  if (x < 0) x *= -1, fl = 1;
  string lol = "";
  if (x == 0) return "0";
  while (x) {
    lol += (char)('0' + (x % 10));
    x /= 10;
  }
  reverse(lol.begin(), lol.end());
  if (fl) lol = "-" + lol;
  return lol;
}
void haha() {
  cout << "Incorrect sequence" << endl;
  exit(0);
}
void solve(int off) {
  int last = off;
  long long li = strToll(s[last]);
  for (int i = off + k; i < n + 2 * k; i += k) {
    if (s[i] != "?") {
      long long si = strToll(s[i]);
      long long dif = si - li;
      if (dif < (i - last) / k) {
        haha();
      }
      if (li >= 0) {
        long long pt = li + 1;
        for (int j = last + k; j < i; j += k) {
          s[j] = llToString(pt);
          pt++;
        }
      } else if (si <= 0) {
        long long pt = si - 1;
        for (int j = i - k; j > last; j -= k) {
          s[j] = llToString(pt);
          pt--;
        }
      } else {
        long long l = -1;
        long long r = 0;
        vector<long long> vec;
        long long d = (i - last - 1);
        d /= k;
        for (int j = 0; j < (d); ++j) {
          if (abs(l) < abs(r) && l > li || r == si) {
            vec.push_back(l), l--;
          } else {
            vec.push_back(r), r++;
          }
        }
        sort(vec.begin(), vec.end());
        for (int j = 0; j < ((int)(vec).size()); ++j) {
          s[last + k * (1 + j)] = llToString(vec[j]);
        }
      }
      last = i;
      li = si;
    }
  }
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  cin >> n >> k;
  string lol = "2000000001";
  int pt = 0;
  for (int i = 0; i < (k); ++i) s[pt] = "-" + lol, pt++;
  for (int i = 0; i < (n); ++i) cin >> s[pt], pt++;
  for (int i = 0; i < (k); ++i) s[pt] = lol, pt++;
  for (int i = 0; i < (k); ++i) {
    solve(i);
  }
  for (int i = 0; i < (n); ++i) {
    cout << s[k + i] << " ";
  }
  cout << endl;
  return 0;
}
