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 main() {
  int n, k;
  cin >> n >> k;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    if (s == "?")
      arr[i] = -1791791791;
    else
      arr[i] = atoi(s.c_str());
  }
  vector<vector<int> > vecs(k);
  for (int i = 0; i < n; i++) vecs[i % k].push_back(arr[i]);
  for (int i = 0; i < k; i++) {
    size_t j = 0;
    if (vecs[i][0] == -1791791791) {
      while (j < vecs[i].size() && vecs[i][j] == -1791791791) j++;
      if (j == vecs[i].size()) {
        for (int t = 0; t < (int)j; t++) vecs[i][t] = t - (int)j / 2;
      } else {
        for (int t = 0; t < (int)j; t++)
          if (vecs[i][j] <= (int)j / 2) {
            vecs[i][t] = vecs[i][j] - (int)j + t;
          } else
            vecs[i][t] = t - (int)j / 2;
      }
    }
    while (j < vecs[i].size()) {
      if (vecs[i][j] == -1791791791) {
        size_t t = j;
        int first = vecs[i][j - 1];
        while (t < vecs[i].size() && vecs[i][t] == -1791791791) t++;
        int last = 1791791791;
        if (t != vecs[i].size()) last = vecs[i][t];
        for (int p = j; p < (int)t; p++)
          if (first >= -((int)t - (int)j) / 2 ||
              last <= ((int)t - (int)j + 1) / 2) {
            if (first >= -((int)t - (int)j + 1) / 2 ||
                last <= ((int)t - (int)j) / 2)
              vecs[i][p] = vecs[i][j - 1] + (int)p - (int)j + 1;
            else
              vecs[i][p] = p - (t - j + 1) / 2;
          } else
            vecs[i][p] = (p - j) - (t - j) / 2;
      } else
        j++;
    }
  }
  vector<int> new_arr(n);
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < (int)vecs[i].size() - 1; j++) {
      if (vecs[i][j] >= vecs[i][j + 1]) {
        cout << "Incorrect sequence" << endl;
        return 0;
      }
      new_arr[j * k + i] = vecs[i][j];
    }
    new_arr[((int)vecs[i].size() - 1) * k + i] =
        vecs[i][(int)vecs[i].size() - 1];
  }
  for (int i = 0; i < n; i++) cout << new_arr[i] << " ";
  cout << endl;
  return 0;
}
