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;
int n, k;
const int MAX_INT = 0x3f3f3f3f;
int seq[100010];
int convert(char a[]) {
  int len = strlen(a), f, s;
  if (a[0] == '-')
    f = -1, s = 1;
  else
    f = 1, s = 0;
  int ans = 0;
  for (int i = s; i < len; ++i) ans = ans * 10 + a[i] - '0';
  return f * ans;
}
void setnum(int to, int need, int da, int xiao) {
  if ((-need / 2) <= xiao) {
    int cn = 1;
    for (int i = to - need * k; i < to; i += k) {
      seq[i] = xiao + cn;
      cn++;
    }
  } else if (need / 2 >= da) {
    int cn = 1;
    for (int i = to - k; i >= to - need * k; i -= k) {
      seq[i] = da - cn;
      cn++;
    }
  } else {
    int cn = need / 2;
    for (int i = to - k; i >= to - need * k; i -= k) {
      seq[i] = cn;
      cn--;
    }
  }
}
int main() {
  scanf("%d%d", &n, &k);
  char a[15];
  for (int i = 0; i < n; ++i) {
    scanf("%s", a);
    if (strcmp(a, "?") == 0)
      seq[i] = MAX_INT;
    else
      seq[i] = convert(a);
  }
  int flag = 0;
  for (int i = 0; i < k; ++i) {
    int j = i;
    int need = 0;
    while (j < n) {
      if (seq[j] == MAX_INT) {
        need++;
      } else {
        if (need == 0) {
          if (j >= k && seq[j] <= seq[j - k]) {
            flag = 1;
            break;
          }
        } else {
          if (j - (need + 1) * k >= 0) {
            if (seq[j] - seq[j - (need + 1) * k] > need) {
              setnum(j, need, seq[j], seq[j - (need + 1) * (k)]);
            } else {
              flag = 1;
              break;
            }
          } else {
            if (seq[j] - (-1e9) > need) {
              setnum(j, need, seq[j], -1e9);
            } else {
              flag = 1;
              break;
            }
          }
          need = 0;
        }
      }
      j = j + k;
    }
    if (need > 0) {
      if (j - (need + 1) * k >= 0) {
        if (1e9 - seq[j - (need + 1) * k] > need) {
          setnum(j, need, 1e9, seq[j - (need + 1) * k]);
        } else {
          flag = 1;
          break;
        }
      } else {
        setnum(j, need, 1e9, -1e9);
      }
    }
    if (flag == 1) break;
  }
  if (flag == 1)
    printf("Incorrect sequence\n");
  else {
    for (int i = 0; i < n; ++i) {
      printf("%d ", seq[i]);
    }
  }
  return 0;
}
