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 Iter>
ostream& _out(ostream& s, Iter a, Iter b) {
  for (auto it = a; it != b; it++) s << (it == a ? "" : " ") << *it;
  return s;
}
template <typename A, typename B>
ostream& operator<<(ostream& s, pair<A, B>& p) {
  return s << "(" << p.first << " , " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, vector<T>& v) {
  return _out(s, v.begin(), v.end());
}
inline long long rit() {
  int key = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') key = -1;
    c = getchar();
  }
  long long x = 0;
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * key;
}
int __ = 1;
void init() {}
void read() {}
void solve() {}
vector<int> G[100010];
vector<int> get_val(int l, int r, int cnt) {
  vector<int> box;
  if (l >= 0 && r >= 0) {
    for (int i = 0; i < cnt; i++) box.push_back(l + i + 1);
  }
  if (l <= 0 && r <= 0) {
    for (int i = 0; i < cnt; i++) box.push_back(r - i - 1);
    reverse(box.begin(), box.end());
  }
  if (r > 0 && l < 0) {
    int pos = cnt / 2;
    if (-pos <= l) pos -= l + pos + 1;
    if (cnt - pos - 1 >= r) pos += cnt - pos - 1 - r + 1;
    int start = -pos;
    for (int i = 0; i < cnt; i++) box.push_back(start + i);
  }
  return box;
}
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < k; i++) G[i].push_back(-0x3f3f3f3f);
  for (int i = 0; i < n; i++) {
    int pos = i % k;
    string s;
    int x;
    cin >> s;
    if (s == "?")
      x = -0x3f3f3f3f - 1;
    else {
      stringstream ss(s);
      ss >> x;
    }
    G[pos].push_back(x);
  }
  for (int i = 0; i < k; i++) G[i].push_back(0x3f3f3f3f);
  for (int i = 0; i < k; i++) {
    for (int j = 1; j < G[i].size() - 1; j++) {
      if (G[i][j] == -0x3f3f3f3f - 1) {
        int id = j;
        while (id + 1 < G[i].size() - 1 && G[i][id + 1] == -0x3f3f3f3f - 1)
          id++;
        vector<int> v = get_val(G[i][j - 1], G[i][id + 1], id - j + 1);
        for (int k = j; k <= id; k++) G[i][k] = v[k - j];
      }
    }
  }
  int ok = 1;
  for (int i = 0; i < k; i++)
    for (int j = 1; j < G[i].size() - 1; j++) {
      if (G[i][j] == -0x3f3f3f3f - 1 || G[i][j] <= G[i][j - 1]) ok = 0;
    }
  if (ok == 0) {
    printf("Incorrect sequence\n");
    return 0;
  }
  for (int i = 0; i < k; i++) {
    reverse(G[i].begin(), G[i].end());
    G[i].pop_back();
  }
  int now = 0;
  for (int i = 0; i < n; i++) {
    printf("%d ", G[now].back());
    G[now].pop_back();
    now = (now + 1) % k;
  }
  puts("");
  return 0;
}
