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, t, i, k, j, flag;
int d[100010], q[100010], a[100010];
vector<int> v[100010];
char ch[100010];
void Puts(int x, int l, int r, int xl, int xr) {
  int d = xr - xl + 1, i;
  if (r - l + 1 < d) {
    flag = 1;
    return;
  }
  if (l >= 0 && r >= 0) {
    for (i = xl; i <= xr; i++) v[x][i] = i - xl + l;
    return;
  }
  if (l <= 0 && r <= 0) {
    for (i = xr; i >= xl; i--) v[x][i] = r + i - xr;
    return;
  }
  if (abs(l) < abs(r)) {
    int z = d / 2;
    if (z >= abs(l)) {
      for (i = xl; i <= xr; i++) v[x][i] = l + i - xl;
      return;
    }
    z = -d / 2;
    for (i = xl; i <= xr; i++) v[x][i] = z + i - xl;
    return;
  }
  int z = d / 2;
  if (z >= abs(r)) {
    for (i = xr; i >= xl; i--) v[x][i] = r - xr + i;
    return;
  }
  z = -d / 2;
  for (i = xl; i <= xr; i++) v[x][i] = z + i - xl;
}
void Solve(int x) {
  int i, t = 0;
  for (i = 1; i <= d[x]; i++)
    if (v[x][i] != -1000000001) q[++t] = i;
  if (!t) {
    int z = -d[x] / 2;
    for (i = 1; i <= d[x]; i++) v[x][i] = z + i - 1;
    return;
  }
  if (t < 2)
    return Puts(x, -1100000000, v[x][q[1]] - 1, 1, q[1] - 1),
           Puts(x, v[x][q[t]] + 1, 1100000000, q[t] + 1, d[x]);
  Puts(x, -1100000000, v[x][q[1]] - 1, 1, q[1] - 1),
      Puts(x, v[x][q[t]] + 1, 1100000000, q[t] + 1, d[x]);
  for (i = 1; i < t; i++)
    Puts(x, v[x][q[i]] + 1, v[x][q[i + 1]] - 1, q[i] + 1, q[i + 1] - 1);
}
int Change() {
  int n = strlen(ch), s = 0, st = 0, p = 1;
  if (ch[0] == '-') p = -1, st++;
  for (int i = st; i < n; i++) s = s * 10 + ch[i] - '0';
  return s * p;
}
int main() {
  scanf("%d%d", &n, &k);
  for (i = 1; i <= n; i++) {
    scanf("%s", ch);
    if (ch[0] == '?')
      a[i] = -1000000001;
    else
      a[i] = Change();
  }
  for (i = 0; i < k; i++) v[i].push_back(-1);
  for (i = 1; i <= n; i++) {
    v[i % k].push_back(a[i]);
    ++d[i % k];
  }
  for (i = 0; i < k; i++) Solve(i);
  if (flag) {
    printf("Incorrect sequence");
    return 0;
  }
  for (int j = 1; j <= d[0]; j++)
    for (i = 1; i <= k; i++) printf("%d ", v[i % k][j]);
  for (i = 1; d[i] > d[0]; i++) printf("%d ", v[i][d[i]]);
  return 0;
}
