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, ad, a[444444], u[444444];
char str[11];
int getnum(char str[]) {
  int ret = 0, neg = -1, i = 1;
  if (str[0] != '-') {
    neg = 1;
    i = 0;
  }
  for (; str[i]; i++) {
    ret = ret * 10 + str[i] - '0';
  }
  ret *= neg;
  return ret;
}
int main() {
  int i, j, fg = 0, nd, pd, ll, lt, rt, ds, mid, ld;
  cin >> n >> k;
  ad = k;
  for (i = 1; i <= n; i++) {
    scanf("%s", str);
    if (str[0] == '?')
      a[i + ad] = 1;
    else
      u[i + ad] = getnum(str);
  }
  for (i = 1; i <= ad; i++) {
    u[i] = -1010000000 + i;
    u[ad + n + i] = 1010000000 + i;
  }
  for (i = 1; i <= k; i++) {
    if (fg) break;
    nd = pd = -1;
    ll = u[i];
    for (j = i + k; j <= n + 2 * ad; j += k) {
      if (a[j]) continue;
      if (u[j] <= ll) {
        fg = 1;
        break;
      }
      ll = u[j];
    }
    if (fg) break;
    for (j = i; j <= n + 2 * ad; j += k) {
      if (pd == -1 && !a[j] && u[j] >= 0) {
        pd = j;
        break;
      }
    }
    for (j = pd; j >= 1; j -= k) {
      if (nd == -1 && !a[j] && u[j] < 0) {
        nd = j;
        break;
      }
    }
    for (j = pd + k; j <= n + 2 * ad; j += k) {
      ld = j - k;
      if (!a[j]) {
        if (u[ld] >= u[j]) fg = 1;
        continue;
      }
      if (fg) break;
      a[j] = 0;
      u[j] = u[ld] + 1;
    }
    if (fg) break;
    for (j = nd - k; j >= 1; j -= k) {
      ld = j + k;
      if (!a[j]) {
        if (u[j] >= u[ld]) fg = 1;
        continue;
      }
      if (fg) break;
      a[j] = 0;
      u[j] = u[ld] - 1;
    }
    mid = (pd - nd) / k - 1;
    if (mid > u[pd] - u[nd]) {
      fg = 1;
      break;
    }
    lt = -((mid - 1) / 2);
    rt = mid / 2;
    if (u[pd] <= rt) {
      ds = rt - u[pd] + 1;
      rt -= ds;
      lt -= ds;
    }
    if (u[nd] >= lt) {
      ds = u[nd] - lt + 1;
      rt += ds;
      lt += ds;
    }
    for (j = nd + k; j < pd; j += k) {
      u[j] = lt;
      lt++;
    }
  }
  if (fg)
    puts("Incorrect sequence");
  else {
    for (i = k + 1; i <= k + n; i++) printf("%d ", u[i]);
    puts("");
  }
  return 0;
}
