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 long long N = 200202;
const long long P = 1000000007;
long long a[N], b[N], s, x, n, k;
char C;
void ge(long long I) {
  s = 1;
  x = 0;
  C = getchar();
  while (C != '-' && C != '?' && (!('0' <= C && C <= '9'))) C = getchar();
  if (C == '?') {
    b[I] = 1;
    return;
  } else if (C == '-')
    s = -1;
  else
    x = C - '0';
  C = getchar();
  while ('0' <= C && C <= '9') {
    x = x * 10 + C - '0';
    C = getchar();
  }
  a[I] = x * s;
}
long long go(long long y) {
  if (y > n) return y;
  if (b[y] == 0) return y;
  return go(y + k);
}
vector<long long> ge(long long l, long long r, long long x) {
  if (r - l + 1 < x) {
    cout << "Incorrect sequence" << endl;
    exit(0);
  }
  vector<long long> R;
  if (l <= 0 && 0 <= r) {
    R.push_back(0);
    long long xx = 1;
    while (R.size() < x) {
      if (xx <= r) R.push_back(xx);
      if (l <= -xx)
        if (R.size() < x) R.push_back(-xx);
      xx++;
    }
    sort(R.begin(), R.end());
    return R;
  }
  if (l >= 0) {
    for (int i = 0; i < x; i++) R.push_back(i + l);
    return R;
  }
  for (int i = 0; i < x; i++) R.push_back(r - i);
  sort(R.begin(), R.end());
  return R;
}
bool ch() {
  for (int i = 1; i <= k; i++) {
    for (int j = i + k; j <= n; j += k)
      if (a[j] <= a[j - k]) {
        return 1;
      }
  }
  return 0;
}
int main() {
  scanf("%I64d%I64d", &n, &k);
  for (int i = 1; i <= n; i++) ge(i);
  long long fin = 0, li, las = -101000000001ll;
  vector<long long> v;
  for (int i = 1; i <= k; i++) {
    fin = 0;
    li = i;
    las = -101000000001ll;
    while (li <= n) {
      if (b[li] == 1) {
        fin = go(li + k);
        if ((fin - li) / k > 0) {
          if (fin <= n) {
            v = ge(las + 1, a[fin] - 1, (fin - li) / k);
            las = a[fin];
          } else
            v = ge(las + 1, 101000000001ll, (fin - li) / k);
          for (int i = 0; i < (fin - li) / k; i++) a[li + i * k] = v[i];
        }
        li = fin + k;
      } else
        las = a[li], li += k;
    }
  }
  if (ch()) {
    cout << "Incorrect sequence" << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) printf("%I64d ", a[i]);
bolo:
  return 0;
}
