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;
long long v[100100], s[100100];
int n, k, len, a[100100], b[100100];
char second[30];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> second;
    if (second[0] == '?')
      b[i] = 1;
    else {
      int r = strlen(second);
      int semn = 1;
      for (register int j = 0; j < r; ++j) {
        if (j == 0 && second[j] == '-') {
          semn = -1;
          continue;
        }
        v[i] = v[i] * 10 + second[j] - '0';
      }
      v[i] *= semn;
    }
  }
  for (int i = 1; i <= k; ++i) {
    int t = 0;
    for (int j = i; j <= n; j += k) {
      ++t;
      a[t] = 0;
      if (b[j]) a[t] = b[j];
      s[t] = v[j];
    }
    int p = 1;
    long long mi = -1100000001;
    for (int j = 1; j <= t; ++j) {
      int p = j;
      while (a[j] && j <= t) ++j;
      if (j == t + 1 && a[j - 1]) {
        --j;
        if (mi < 0) {
          len = j - p + 1;
          len /= 2;
          len = -len;
          if (mi + 1 > len) len = mi + 1;
          for (int k = p; k <= j; ++k) s[k] = len++;
        } else
          for (int k = p; k <= j; ++k) s[k] = ++mi;
        break;
      }
      if (j == p) {
        mi = s[j];
        continue;
      }
      if (s[j] >= 0) {
        if (mi >= 0) {
          for (int k = p; k <= j - 1; ++k) s[k] = ++mi;
        } else {
          len = j - 1 - p + 1;
          len /= 2;
          len = -len;
          if (mi + 1 > len) len = mi + 1;
          if (len + j - 1 - p >= s[j]) len -= len + j - 1 - p - s[j] + 1;
          for (int k = p; k <= j - 1; ++k) s[k] = len++;
        }
        mi = s[j];
      } else {
        len = j - 1 - p + 1;
        mi = s[j] - len - 1;
        for (int k = p; k <= j - 1; ++k) s[k] = ++mi;
        mi = s[j];
      }
    }
    t = 0;
    for (int j = i; j <= n; j += k) {
      ++t;
      v[j] = s[t];
    }
  }
  for (int i = k + 1; i <= n; ++i)
    if (v[i] <= v[i - k]) {
      cout << "Incorrect sequence";
      return 0;
    }
  for (int i = 1; i <= n; ++i) cout << v[i] << " ";
  return 0;
}
