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>
#pragma warning(disable : 4996)
using namespace std;
int n, m;
int a[200000];
char tmp[200000];
int b[200000];
int bi;
int c[200000];
int ci;
int d[200000];
vector<int> dab;
void calc() {
  int i, j;
  int cnt = 0;
  d[0] = -((1 << 30) - 1);
  ci = 0;
  for (i = 0; i < bi; i++) {
    if (b[i] == ((1 << 30) - 1))
      cnt++;
    else {
      c[++ci] = cnt;
      d[ci] = b[i];
      cnt = 0;
    }
  }
  c[++ci] = cnt;
  d[ci++] = ((1 << 30) - 1);
  for (i = 0; i < ci - 1; i++) {
    if (d[i + 1] - d[i] - 1 < c[i + 1]) {
      printf("Incorrect sequence");
      exit(0);
    }
  }
  dab.clear();
  for (i = 0; i < ci - 1; i++) {
    if (c[i + 1] == 0) continue;
    if (d[i] <= 0 && d[i + 1] <= 0) {
      for (j = d[i + 1] - c[i + 1]; j <= d[i + 1] - 1; j++) dab.push_back(j);
    } else if (d[i] >= 0 && d[i + 1] >= 0) {
      for (j = d[i] + 1; j <= d[i] + c[i + 1]; j++) dab.push_back(j);
    } else {
      if (min(abs(d[i + 1] - 1), abs(d[i] + 1)) * 2 + 1 >= c[i + 1]) {
        for (j = -(c[i + 1] - 1) / 2; j <= (c[i + 1] / 2); j++)
          dab.push_back(j);
      } else {
        int u = min(abs(d[i + 1] - 1), abs(d[i] + 1));
        if (abs(d[i + 1] - 1) > abs(d[i] + 1)) {
          for (j = -u; j <= u; j++) dab.push_back(j);
          for (j = u + 1;
               j <=
               u + c[i + 1] - min(abs(d[i + 1] - 1), abs(d[i] + 1)) * 2 - 1;
               j++)
            dab.push_back(j);
        } else {
          for (j = -u -
                   (c[i + 1] - min(abs(d[i + 1] - 1), abs(d[i] + 1)) * 2 - 1);
               j <= -u - 1; j++)
            dab.push_back(j);
          for (j = -u; j <= u; j++) dab.push_back(j);
        }
      }
    }
  }
}
int main() {
  int i, j, k;
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    scanf("%s", tmp);
    if (tmp[0] == '?')
      a[i] = ((1 << 30) - 1);
    else
      a[i] = atoi(tmp);
  }
  for (i = 0; i < m; i++) {
    bi = 0;
    for (j = i; j < n; j += m) {
      b[bi++] = a[j];
    }
    calc();
    int u = 0;
    for (j = i; j < n; j += m) {
      if (a[j] == ((1 << 30) - 1)) a[j] = dab[u++];
    }
  }
  for (i = 0; i < n; i++) printf("%d ", a[i]);
  return 0;
}
