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;
template <typename T>
struct Pt {
  T x, y;
  void scan() { cin >> x >> y; }
};
template <typename T>
inline T sqr(const T& a) {
  return a * a;
}
template <typename T>
inline int sign(const T& a) {
  return a < 0 ? -1 : a > 0;
}
void task();
int main() {
  task();
  return 0;
}
const int INF = 1e9 + 5e5 + 100;
struct S {
  int real_pos;
  int value;
};
int n, k;
int a[int(1e5) + 10];
bool can_trans(vector<S>& v) {
  int is_free = 1;
  for (int i = 0; i < (int)v.size(); ++i)
    if (v[i].value != INF) {
      is_free = 0;
      break;
    }
  if (is_free) {
    int mn = -((int)v.size() / 2);
    for (int i = 0; i < (int)v.size(); ++i) v[i].value = mn, mn++;
    return true;
  }
  int id = 0;
  while (v[id].value == INF) ++id;
  if (id) {
    int mn = -id / 2;
    if (mn + id - 1 > v[id].value - 1) mn = v[id].value - id;
    for (int i = 0, val = mn; i < id; ++i, ++val) v[i].value = val;
  }
  int left_ = id;
  id = v.size() - 1;
  while (v[id].value == INF) --id;
  if (id != (int)v.size() - 1) {
    int len = (int)v.size() - id - 1;
    int mn = -(len / 2);
    if (mn < v[id].value + 1) mn = v[id].value + 1;
    for (int i = id + 1, val = mn; i < (int)v.size(); ++i, ++val)
      v[i].value = val;
  }
  int right_ = id;
  while (left_ != right_) {
    int id = left_ + 1;
    while (v[id].value == INF) ++id;
    if (v[id].value - v[left_].value < id - left_) return false;
    int len = id - left_ - 1;
    int mn = -(len / 2);
    if (mn < v[left_].value + 1) mn = v[left_].value + 1;
    if (mn + len - 1 > v[id].value - 1) mn = v[id].value - len;
    for (int i = left_ + 1, val = mn; i < id; ++i, ++val) v[i].value = val;
    left_ = id;
  }
  return true;
}
void task() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    if (s == "?")
      a[i] = INF;
    else
      a[i] = atoi(s.c_str());
  }
  for (int j = 0; j < k; ++j) {
    vector<S> v;
    for (int i = j; i < n; i += k) v.push_back({i, a[i]});
    if (!can_trans(v)) {
      cout << "Incorrect sequence";
      return;
    }
    for (auto& x : v) a[x.real_pos] = x.value;
  }
  for (int i = 0; i < n; ++i) cout << a[i] << ' ';
}
