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 int a[100005], t[100005];
bool work(int x) {
  int prev, i, j, xx;
  long long int n, q1, q2, q, till, dif;
  prev = 0;
  for (i = 1; i < x; i++) {
    if (t[i] == 100000000000000LL) continue;
    dif = t[i] - t[prev];
    if (dif <= (i - prev - 1)) return false;
    if (t[prev] >= 0)
      for (j = prev + 1; j < i; j++) t[j] = t[prev] + (j - prev);
    else if (t[i] <= 0)
      for (j = i - 1; j > prev; j--) t[j] = t[i] - (i - j);
    else if (prev != (i - 1)) {
      till = 2 * 100000000000000LL;
      for (j = prev + 1; j < i; j++) {
        n = (i - 1 - j);
        q1 = (n * (n + 1)) >> 1;
        n = (j - prev - 1);
        q2 = (n * (n + 1)) >> 1;
        q = q1 + q2;
        if (q <= till) {
          xx = j;
          till = q;
        }
      }
      t[xx] = 0;
      for (j = xx + 1; j < i; j++) t[j] = (j - xx);
      for (j = xx - 1; j > prev; j--) t[j] = -(xx - j);
    }
    prev = i;
  }
  return true;
}
int main() {
  int n, k, i, j, x;
  char s[100];
  cin >> n >> k;
  for (i = 1; i <= n; i++) {
    cin >> s;
    if (s[0] == '?')
      a[i] = 100000000000000LL;
    else {
      a[i] = atoi(s);
    }
  }
  t[0] = -2 * 100000000000000LL;
  for (i = 1; i <= k; i++) {
    x = 1;
    for (j = i; j <= n; j += k) t[x++] = a[j];
    t[x++] = 2 * 100000000000000LL;
    if (!work(x)) break;
    for (j = 1; j < (x - 1); j++) a[i + ((j - 1) * k)] = t[j];
  }
  if (i <= k)
    cout << "Incorrect sequence\n";
  else {
    for (i = 1; i <= n; i++) cout << a[i] << " ";
    cout << endl;
  }
  return 0;
}
