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;
int DEBUG = 1;
const int maxn = 2e5;
int a[maxn];
int b[maxn];
int us[maxn];
long long l[maxn];
long long r[maxn];
int n, k;
void tlen() {
  cout << "Incorrect sequence" << endl;
  exit(0);
}
void koko(vector<int>& a) {
  vector<int> b(a.size());
  int l = 0, r = a.size() - 1;
  for (int i = a.size() - 1; i >= 0; i--) {
    if (a[i] <= 0)
      b[l] = a[i], l++;
    else
      b[r] = a[i], r--;
  }
  swap(a, b);
}
inline void solve(vector<int>& y, long long r) {
  if (y.empty()) return;
  long long l = ::l[y[0]];
  vector<int> ans1, ans2, ans3;
  long long a1, a2, a3 = a2 = a1 = 3e15;
  if (l <= 0 && 0 < r) {
    vector<int> pl, mn;
    pl.push_back(0);
    a1 = 0;
    int d = 0;
    bool f = ans1.size() < y.size();
    for (d = 1; f; d++) {
      if (pl.size() + mn.size() == y.size()) break;
      if (l <= -d) a1 += d, f = 1, mn.push_back(-d);
      if (pl.size() + mn.size() == y.size()) break;
      if (d < r) a1 += d, f = 1, pl.push_back(d);
      if (pl.size() + mn.size() == y.size()) break;
    }
    ans1.insert(ans1.end(), mn.rbegin(), mn.rend());
    ans1.insert(ans1.end(), pl.begin(), pl.end());
    if (ans1.size() != y.size()) a1 = 3e15;
  }
  a2 = 0;
  for (int i = 0; i < (int)y.size(); i++) {
    if (l + i >= r) break;
    ans2.push_back(i + l);
    a2 += abs(i + l);
  }
  if (ans2.size() < y.size()) a2 = 3e15;
  a3 = 0;
  for (int i = 0; i < (int)y.size(); i++) {
    if (r - i - 1 < l) break;
    ans3.push_back(r - i - 1);
    a3 += abs(r - i - 1);
  }
  reverse(ans3.begin(), ans3.end());
  if (ans3.size() < y.size()) a3 = 3e15;
  vector<int> ans;
  long long dlt;
  bool f = 1;
  if (a1 <= a2 && a1 <= a3) {
    f = 0, swap(ans, ans1);
  }
  if (a2 <= a1 && a2 <= a3) {
    swap(ans, ans2);
  }
  if (a3 <= a2 && a3 <= a1) {
    swap(ans, ans3);
  }
  if (ans.size() != y.size()) tlen();
  for (int i = 0; i < (int)y.size(); i++) a[y[i]] = ans[i];
  y.clear();
}
char s[100];
int matoi(string& s) {
  int x = 0;
  int f = 0;
  if (s[0] == '-') f = 1;
  for (int i = 0; i < (int)s.size() - f; i++) x = 10 * x + s[i + f] - '0';
  if (f) return -x;
  return x;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 0; i < (int)n; i++) {
    string s;
    cin >> s;
    if (s[0] != '?')
      a[i] = matoi(s);
    else
      b[i] = 1;
  }
  vector<int> y;
  for (int i = 0; i < min(n, k); i++) {
    if (b[i]) {
      l[i] = -2e9;
      y.push_back(i);
    } else
      l[i] = a[i];
    int j = i + k;
    for (; j < n; j += k) {
      if (b[j]) {
        l[j] = l[j - k] + 1;
        y.push_back(j);
      } else {
        if (a[j] <= l[j - k]) tlen();
        solve(y, a[j]);
        l[j] = a[j];
      }
    }
    solve(y, 2e9);
  }
  for (int i = 0; i < (int)n; i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
