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 inf = 1e9;
int n, k;
int a[100001];
int lb[100001], ub[100001];
char temp[100];
vector<int> buc[100001];
void cl(vector<int> x) {
  int l = -1, r = x.size();
  for (int i = 0; i < x.size(); i++)
    if (a[x[i]] == inf + 1) {
      if (lb[x[i]] <= 0 && ub[x[i]] >= 0) {
        if (l == -1) l = i;
      } else if (l != -1 && r == x.size())
        r = i;
    }
  if (l != -1) {
    if (r == x.size()) r--;
    int mid = l + r >> 1;
    a[x[mid]] = 0;
    for (int i = mid + 1; i < x.size(); i++)
      if (a[x[i]] == inf + 1) a[x[i]] = a[x[i - 1]] + 1;
    for (int i = mid - 1; ~i; i--)
      if (a[x[i]] == inf + 1) a[x[i]] = a[x[i + 1]] - 1;
  } else {
    for (int i = 0; i < x.size(); i++)
      if (a[x[i]] == inf + 1)
        if (lb[x[i]] > 0) a[x[i]] = a[x[i - 1]] + 1;
    for (int i = x.size() - 1; ~i; i--)
      if (a[x[i]] == inf + 1)
        if (ub[x[i]] < 0) a[x[i]] = a[x[i + 1]] - 1;
  }
}
bool solve() {
  for (int i = k + 1; i <= n; i++)
    if (a[i] == inf + 1) {
      if (a[i - k] == inf + 1)
        lb[i] = lb[i - k] + 1;
      else
        lb[i] = a[i - k] + 1;
    }
  for (int i = n - k; i; i--)
    if (a[i] == inf + 1) {
      if (a[i + k] == inf + 1)
        ub[i] = ub[i + k] - 1;
      else
        ub[i] = a[i + k] - 1;
    }
  for (int i = 1; i <= n; i++)
    if (a[i] == inf + 1) {
      if (lb[i] > ub[i]) return 0;
    } else {
      if (i > k)
        if (a[i - k] == inf + 1) {
          if (lb[i - k] >= a[i]) return 0;
        } else if (a[i] <= a[i - k])
          return 0;
      if (i + k <= n)
        if (a[i + k] == inf + 1) {
          if (ub[i + k] <= a[i]) return 0;
        }
    }
  for (int i = 1; i <= n; i++) buc[(i - 1) % k + 1].push_back(i);
  for (int i = 1; i <= k; i++) cl(buc[i]);
  return 1;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%s", temp);
    if (temp[0] == '?')
      lb[i] = -inf, ub[i] = inf, a[i] = inf + 1;
    else
      a[i] = atoi(temp);
  }
  if (!solve())
    puts("Incorrect sequence");
  else
    for (int i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
  return 0;
}
