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 Q = 1001000001;
int s[201010];
int u[101010];
int mn[101010];
int mx[101010];
int n, k;
bool jee;
void mk() {
  mn[0] = -Q - 1;
  mx[u[0]] = Q + 1;
  for (int i = 1; i < u[0]; ++i) {
    if (u[i] != Q) {
      if (u[i] <= mn[i - 1]) jee = 0;
      mn[i] = u[i];
    } else
      mn[i] = mn[i - 1] + 1;
  }
  for (int i = u[0] - 1; i > 0; --i) {
    if (u[i] != Q) {
      if (u[i] >= mx[i + 1]) jee = 0;
      mx[i] = u[i];
    } else
      mx[i] = mx[i + 1] - 1;
  }
  int a = 0;
  for (int i = 1; i < u[0]; ++i) {
    if (u[i] == Q) {
      if (a == 0)
        for (a = 1; u[i + a] == Q && i + a < u[0]; ++a)
          ;
      if (mx[i] < mn[i]) jee = 0;
      if (mx[i] == mn[i])
        u[i] = mx[i];
      else if (mn[i] > 0)
        u[i] = mn[i];
      else if (mx[i + a - 1] < 0)
        u[i] = mx[i];
      else {
        u[i] = min(max(-a / 2, mn[i]), mx[i + a - 1] - a + 1);
        for (int j = 1; j < a; ++j) mn[i + j] = u[i] + j;
      }
      --a;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  jee = 1;
  for (int i = 0; i < 101010; ++i) s[i] = Q;
  cin >> n >> k;
  char c;
  for (int i = 0; i < n; ++i) {
    cin >> ws;
    c = cin.peek();
    if (c == '?')
      cin >> c;
    else
      cin >> s[i];
  }
  for (int i = 0; i < k; ++i) {
    for (int j = i; j < n; j += k) {
      u[j / k + 1] = s[j];
      u[0] = j / k + 2;
    }
    mk();
    for (int j = i; j < n; j += k) {
      s[j] = u[j / k + 1];
    }
  }
  if (jee)
    for (int i = 0; i < n; ++i) cout << s[i] << " ";
  else
    cout << "Incorrect sequence";
}
