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;
void scan(int &x) {
  register int c = getchar();
  x = 0;
  int neg = 0;
  for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
    ;
  if (c == '-') {
    neg = 1;
    c = getchar();
  }
  if (neg) x = -x;
}
const int M = 100005;
int a[M];
vector<pair<long long, long long> > g[M];
bool vis[M];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  string s;
  for (int i = 0; i < n; i++) {
    cin >> s;
    if (s[0] == '?')
      a[i + 1] = -2e9;
    else {
      int e = 0, j = 0, flag = 1;
      if (s[0] == '-') j++, flag = -1;
      for (; j < (int)s.size(); j++) e = e * 10 + (s[j] - '0');
      a[i + 1] = e * flag;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      g[i].push_back(make_pair(-2e9 - 1, i - k));
      int j = i;
      for (; j <= n; j += k) {
        if (a[j] != -2e9) g[i].push_back(make_pair(a[j], j));
        vis[j] = 1;
      }
      g[i].push_back(make_pair(2e9 + 1, j));
    }
  }
  bool flag = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (int)g[i].size() - 1; j++) {
      if (!(g[i][j + 1].first - g[i][j].first >=
            (g[i][j + 1].second - g[i][j].second) / k)) {
        flag = 1;
        break;
      }
    }
    if (flag == 1) break;
  }
  if (flag == 1) {
    puts("Incorrect sequence\n");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (g[i].size() == 0) break;
    for (int j = 0; j < (int)g[i].size() - 1; j++) {
      int sz = ((g[i][j + 1].second - g[i][j].second) / k) - 1, st;
      if (g[i][j].first < 0 && g[i][j + 1].first > 0) {
        st = max(g[i][j + 1].first - sz, g[i][j].first + 1);
        if (g[i][j].first < -sz / 2 && g[i][j + 1].first > sz / 2) st = -sz / 2;
      }
      if (g[i][j + 1].first <= 0) {
        st = g[i][j + 1].first - sz;
      }
      if (g[i][j].first >= 0) {
        st = g[i][j].first + 1;
      }
      for (int l = g[i][j].second + k; l < g[i][j + 1].second; l += k) {
        a[l] = st++;
      }
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  printf("\n");
  return 0;
}
