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 int oo = (int)1e9;
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
int n, k;
int arr[100005];
bool fix(int prvIdx, int lastIdx, int prvVal, int lastVal) {
  int cnt = 0;
  for (int i = prvIdx + k; i < lastIdx; i += k) cnt++;
  if ((long long)lastVal - prvVal - 1 < cnt) return false;
  if (prvVal >= 0) {
    for (int i = prvIdx + k, j = 1; j <= cnt; j++, i += k) {
      arr[i] = prvVal + j;
    }
  } else if (lastVal <= 0) {
    for (int i = prvIdx + k, j = cnt; j >= 1; j--, i += k) {
      arr[i] = lastVal - j;
    }
  } else {
    set<int> st;
    for (int i = 0; i < cnt; i++) {
      if (-i > prvVal) st.insert(-i);
      if (((int)st.size()) == cnt) break;
      if (i < lastVal) st.insert(i);
      if (((int)st.size()) == cnt) break;
    }
    int i = prvIdx + k;
    for (__typeof(st.begin()) it = st.begin(); it != st.end(); ++it) {
      arr[i] = (*it);
      i += k;
    }
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  bool question[100005] = {};
  string s;
  cin >> n >> k;
  for (int i = 0; i < (int)(n); ++i) {
    cin >> s;
    if (s == "?")
      question[i] = true;
    else
      arr[i] = atoi(s.c_str());
  }
  for (int i = 0; i < k; i++) {
    int prvVal = -oo - 100005;
    int prvIdx = i - k;
    for (int j = i; j < n; j += k) {
      if (!question[j]) {
        if (!fix(prvIdx, j, prvVal, arr[j])) {
          cout << "Incorrect sequence" << endl;
          return 0;
        }
        prvIdx = j;
        prvVal = arr[j];
      }
    }
    if (!fix(prvIdx, n, prvVal, oo + 100001)) {
      cout << "Incorrect sequence" << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; i++)
    if (i >= k && arr[i] <= arr[i - k]) {
      cout << "Incorrect sequence" << endl;
      return 0;
    }
  for (int i = 0; i < n; i++) {
    cout << arr[i] << " \n"[i == n - 1];
  }
  return 0;
}
