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;
int arr[110001];
char str[21];
int Parse() {
  if (str[1] == '?') return 1999999999;
  int i;
  int L = strlen(str + 1);
  bool ngt = false;
  int num = 0;
  for (i = 1; i <= L; i++) {
    if (str[i] == '-') {
      ngt = true;
      continue;
    }
    num *= 10;
    num += (int)(str[i] - '0');
  }
  if (ngt) num = -num;
  return num;
}
int Line[110001];
int L;
bool Fill(int L, int R, int lowbound, int upbound) {
  if (L > R) return true;
  int i;
  if ((long long)upbound - (long long)lowbound - 1LL <
      (long long)R - (long long)L + 1LL) {
    return false;
  }
  if (upbound <= 0) {
    for (i = R; i >= L; i--) {
      Line[i] = upbound - (R - i + 1);
    }
  } else if (lowbound >= 0) {
    for (i = L; i <= R; i++) {
      Line[i] = lowbound + (i - L + 1);
    }
  } else {
    int wantednegative = (R - L + 1) / 2;
    int wantedpositive = (R - L) / 2;
    int b;
    if (lowbound < -wantednegative && upbound > wantedpositive) {
      b = -wantednegative;
      for (i = L; i <= R; i++) {
        Line[i] = b;
        b++;
      }
    } else if (lowbound >= -wantednegative) {
      b = lowbound + 1;
      for (i = L; i <= R; i++) {
        Line[i] = b;
        b++;
      }
    } else {
      b = upbound - 1;
      for (i = R; i >= L; i--) {
        Line[i] = b;
        b--;
      }
    }
  }
  return true;
}
bool SolveLine() {
  int lowbound = -1999999999;
  int beg = 1;
  int i;
  int curnum = -1999999999;
  for (i = 1; i <= L; i++) {
    if (Line[i] != 1999999999) {
      if (Line[i] <= curnum) return false;
      curnum = Line[i];
    }
  }
  for (i = 1; i <= L; i++) {
    if (Line[i] != 1999999999) {
      if (!Fill(beg, i - 1, lowbound, Line[i])) return false;
      lowbound = Line[i];
      beg = i + 1;
    }
  }
  if (!Fill(beg, L, lowbound, 1999999999)) return false;
  return true;
}
int main() {
  int i, j;
  scanf("%d %d", &n, &k);
  for (i = 1; i <= n; i++) {
    scanf("%s", str + 1);
    arr[i] = Parse();
  }
  for (i = 1; i <= k; i++) {
    L = 0;
    for (j = i; j <= n; j += k) {
      L++;
      Line[L] = arr[j];
    }
    if (!SolveLine()) {
      printf("Incorrect sequence\n");
      return 0;
    }
    L = 0;
    for (j = i; j <= n; j += k) {
      L++;
      arr[j] = Line[L];
    }
  }
  for (i = 1; i <= n; i++) {
    printf("%d", arr[i]);
    if (i != n) printf(" ");
  }
  printf("\n");
  return 0;
}
