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 MAXN = (long long)1e5 + 228;
const long long MAXX = (long long)1.5e9;
long long n, k;
vector<long long> a(MAXN);
vector<bool> fucked(MAXN);
void no() {
  cout << "Incorrect sequence";
  exit(0);
}
vector<long long> kek(long long l, long long r, long long m) {
  assert(m > 0);
  if (m > (r - l - 1)) no();
  vector<long long> ans;
  if (l >= 0) {
    for (long long i = 1; i <= m; ++i) {
      ans.push_back(l + i);
    }
  } else if (r <= 0) {
    for (long long i = 1; i <= m; ++i) {
      ans.push_back(r - i);
    }
    reverse(ans.begin(), ans.end());
  } else {
    ans.push_back(0);
    long long mm = m;
    --mm;
    for (long long i = 1; i <= m; ++i) {
      for (long long sg = -1; sg <= 1; sg += 2) {
        long long val = i * sg;
        if (mm > 0 && val > l && val < r) {
          --mm;
          ans.push_back(val);
        }
      }
    }
  }
  assert(((int)(ans).size()) == m);
  sort(ans.begin(), ans.end());
  return ans;
}
vector<long long> solve(vector<long long>& x, vector<bool>& f) {
  long long l = -MAXX - 1;
  vector<long long> ans;
  for (long long i = 0; i < ((int)(x).size()); ++i) {
    if (!f[i]) {
      l = x[i];
      continue;
    }
    long long j = i + 1;
    long long r = +MAXX + 1;
    while (j < ((int)(x).size()) && f[j]) {
      ++j;
    }
    if (j < ((int)(x).size())) r = x[j];
    vector<long long> foo = kek(l, r, j - i);
    for (int index = i; index < j; ++index) {
      x[index] = foo[index - i];
    }
    i = j - 1;
  }
  return x;
}
int main() {
  cout << setprecision(20);
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  string s;
  for (int i = 0; i < n; ++i) {
    cin >> s;
    if (s == "?") {
      fucked[i] = true;
    } else {
      long long x = stoi(s);
      a[i] = x;
    }
  }
  for (int i = 0; i < k; ++i) {
    vector<long long> x;
    vector<bool> f;
    for (int j = 0; i + k * j < n; ++j) {
      long long idx = i + k * j;
      x.push_back(a[idx]);
      f.push_back(fucked[idx]);
    }
    auto res = solve(x, f);
    for (int j = 0; i + k * j < n; ++j) {
      long long idx = i + k * j;
      if (fucked[idx]) {
        a[idx] = res[j];
      } else {
        assert(a[idx] == res[j]);
      }
    }
  }
  for (int i = 0; i < n - k; ++i) {
    if (a[i] >= a[i + k]) no();
  }
  for (int i = 0; i < n; ++i) {
    cout << a[i] << " ";
  }
  return 0;
}
