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 inf = 1e9;
const int pyt = 2e9;
int n, k;
int A[100005];
bool fun(int i, int s, int t, int a, int b) {
  A[i + s * k] = max(-(t - s + 1) / 2, a + 1);
  for (int j = s + 1; j <= t; j++) {
    A[i + j * k] = A[i + (j - 1) * k] + 1;
  }
  A[i + t * k] = min(A[i + t * k], b - 1);
  for (int j = t - 1; j >= s; j--) {
    A[i + j * k] = A[i + (j + 1) * k] - 1;
  }
  if (A[i + s * k] <= a) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    string tmp;
    cin >> tmp;
    if (tmp == "?")
      A[i] = pyt;
    else
      A[i] = atoi(tmp.c_str());
  }
  for (int i = 0; i < k; i++) {
    bool need = true;
    int cnt;
    for (cnt = 0; i + cnt * k < n; cnt++)
      if (A[i + cnt * k] != pyt) need = false;
    int s;
    for (s = 0; i + s * k < n; s++) {
      if (A[i + s * k] != pyt) {
        if (s == 0) break;
        if (fun(i, 0, s - 1, -inf, A[i + s * k]) == false) {
          cout << "Incorrect sequence" << endl;
          return 0;
        }
        break;
      }
    }
    int t;
    for (t = cnt - 1; t >= 0; t--) {
      if (A[i + t * k] != pyt) {
        if (t == cnt - 1) break;
        if (fun(i, t + 1, cnt - 1, A[i + t * k], inf) == false) {
          cout << "Incorrect sequence" << endl;
          return 0;
        }
        break;
      }
    }
    int last = s;
    for (int j = s + 1; j <= t; j++) {
      if (A[i + j * k] != pyt) {
        if (last == j - 1) {
          if (A[i + last * k] >= A[i + j * k]) {
            cout << "Incorrect sequence" << endl;
            return 0;
          }
          continue;
        }
        if (fun(i, last + 1, j - 1, A[i + last * k], A[i + j * k]) == false) {
          cout << "Incorrect sequence" << endl;
          return 0;
        }
        last = j;
      }
    }
    if (need == true) {
      A[i] = -cnt / 2;
      for (int j = 1; i + j * k < n; j++) A[i + j * k] = A[i + (j - 1) * k] + 1;
    }
  }
  for (int i = 0; i < n; i++) cout << A[i] << " ";
  cout << endl;
}
