#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;
}
