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 MOD = 1000000007;
int INF = 2147483646;
long long INF64 = 9223372036854775807;
long double EPS = 0.000000000001;
long double PI = 3.14159265358979310000;
int n, k, t[123456];
bool mark[123456], mm[123456];
char s[123];
long long a[123456];
int main() {
  int i, j, u, uu, first;
  long long l, r, m;
  cin >> n >> k;
  for (int i = 0; i < int(n); i++) {
    cin >> s;
    if (s[0] != '?')
      a[i] = atoi(s);
    else
      mark[i] = mm[i] = 1;
  }
  for (i = 0; i < k; i++) {
    j = i;
    while (j < n && mark[j]) j += k;
    if (j >= n) {
      int w = -((n - k + 1) / 2);
      j = i;
      while (j < n) {
        a[j] = w;
        w++;
        j += k;
      }
    } else {
      if (i != j) {
        int w = -((j - i - 1) / 2);
        if (w + (j - i) - 1 < a[j]) {
          u = i;
          while (u < j) {
            a[u] = w;
            w++;
            u += k;
          }
        } else {
          u = j - k;
          w = a[j];
          while (u >= i) {
            a[u] = w;
            w--;
            u -= k;
          }
        }
      }
      while (j < n) {
        int w;
        u = j + k;
        if (u >= n) break;
        while (u < n && mark[u]) u += k;
        if (u >= n) {
          if (a[j] >= 0) {
            u = j + k;
            w = a[j] + 1;
            while (u < n) {
              a[u] = w;
              w++;
              u += k;
            }
          } else {
            u -= k;
            w = -((u - j) / 2);
            if (w <= a[j]) w = a[j] + 1;
            u = j + k;
            while (u < n) {
              a[u] = w;
              w++;
              u += k;
            }
          }
          break;
        } else {
          w = -((u - j - 1) / 2);
          if (w <= a[j] || w + (u - j - 1) >= a[u]) w = a[j] + 1;
          uu = j + k;
          if (a[j] + (u - j - 1) >= a[u]) {
            cout << "Incorrect sequence";
            return 0;
          }
          while (uu < n) {
            a[uu] = w;
            w++;
            uu += k;
          }
        }
        j = u;
        u = j + k;
        while (u < n && mark[u]) u += k;
      }
    }
  }
  for (i = 0; i < n; i++) cout << a[i] << ' ';
  return 0;
}
