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 N = 100100;
const int inf = 2000000000;
int n, k, x[N];
char a[100];
int p = 0;
int ter() {
  int r = 0, ver = 1;
  if (a[p] == '-') {
    ++p;
    ver = -1;
  }
  while (a[p] >= '0' && a[p] <= '9') r = r * 10 + a[p++] - '0';
  return r * ver;
}
int gr[N], cs[N], cd[N], nrg, nrel[N], val1[N];
int main() {
  int i;
  cin >> n >> k;
  for (i = 1; i <= n; ++i) {
    cin >> a;
    p = 0;
    if (a[0] == '?')
      x[i] = inf;
    else
      x[i] = ter();
  }
  for (i = 0; i < N; ++i) {
    cs[i] = cd[i] = inf;
  }
  for (i = 1; i <= k; ++i) {
    if (x[i] == inf) {
      ++nrg;
      gr[i] = nrg;
      cs[nrg] = -inf;
      nrel[nrg] = 1;
    }
  }
  for (i = k + 1; i <= n; ++i) {
    if (x[i] != inf && x[i - k] != inf) {
      if (x[i] <= x[i - k]) {
        cout << "Incorrect sequence";
        return 0;
      }
      continue;
    }
    if (x[i] == inf && x[i - k] != inf) {
      ++nrg;
      gr[i] = nrg;
      cs[nrg] = x[i - k];
      nrel[nrg] = 1;
    }
    if (x[i] != inf && x[i - k] == inf) {
      cd[gr[i - k]] = x[i];
    }
    if (x[i] == inf && x[i - k] == inf) {
      gr[i] = gr[i - k];
      nrel[gr[i]]++;
    }
  }
  for (i = 1; i <= nrg; ++i) {
    if (1LL * cd[i] - cs[i] - 1 < 1LL * nrel[i]) {
      cout << "Incorrect sequence";
      return 0;
    }
    if (cs[i] >= 0) {
      val1[i] = cs[i] + 1;
      continue;
    }
    if (cd[i] <= 0) {
      val1[i] = cd[i] - nrel[i];
      continue;
    }
    int aa = nrel[i] / 2;
    if (cs[i] < -aa && cd[i] > aa) {
      val1[i] = -aa;
      continue;
    }
    if (cs[i] < -aa) val1[i] = cd[i] - nrel[i];
    if (cd[i] > aa) val1[i] = cs[i] + 1;
  }
  for (i = 1; i <= n; ++i) {
    if (x[i] == inf) x[i] = val1[gr[i]]++;
    cout << x[i] << " ";
  }
  return 0;
}
