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;
const long long N = 1e6, inf = 1e9;
long long stringToNum(string s) {
  long long f = 1;
  if (s[0] == '-') s.erase(s.begin()), f = -1;
  long long ret = 0;
  for (auto x : s) ret = ret * 10 + x - '0';
  return ret * f;
}
long long aa[N + 2];
long long qm[N + 2];
void print(long long n) {
  for (long long i = 1; i <= n; i++) cout << aa[i] << " ";
  cout << endl;
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k, id = n + 1;
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    string s;
    cin >> s;
    if (s == "?")
      id = i;
    else
      aa[i] = stringToNum(s);
  }
  for (long long i = 1; i <= n; i++) qm[i] = qm[i - 1] + aa[i];
  vector<long long> a, b, c;
  for (long long i = k; i <= n; i++) {
    long long l = i - k + 1, r = i;
    if (id > r)
      a.push_back(qm[r] - qm[l - 1]);
    else if (id >= l && id <= r)
      b.push_back(qm[r] - qm[l - 1]);
    else
      c.push_back(qm[r] - qm[l - 1]);
  }
  for (long long i = 1; i < a.size(); i++)
    if (a[i - 1] >= a[i]) cout << "Incorrect sequence\n", exit(0);
  for (long long i = 1; i < b.size(); i++)
    if (b[i - 1] >= b[i]) cout << "Incorrect sequence\n", exit(0);
  for (long long i = 1; i < c.size(); i++)
    if (c[i - 1] >= c[i]) cout << "Incorrect sequence\n", exit(0);
  if (b.size() == 0) print(n);
  long long mn = -inf * inf;
  if (a.size()) mn = a.back();
  long long mx = inf * inf;
  if (c.size()) mx = c[0];
  long long ad = (mn + 1) - b[0];
  if (ad > inf) ad = inf;
  if (ad < -inf) ad = -inf;
  if (ad + b.back() >= mx) cout << "Incorrect sequence\n", exit(0);
  long long bd = ad + mx - (b.back() + ad) - 1;
  if (ad <= 0 && bd >= 0)
    aa[id] = 0;
  else if (ad < 0 && bd < 0)
    aa[id] = bd;
  else
    aa[id] = ad;
  print(n);
  return 0;
}
