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;
const int maxn = 100005;
const int maxm = 200005;
const int inf = 2e9 + 3;
const int finf = -2e9;
vector<pair<int, int> > bar[maxn];
vector<int> tmp;
int a[maxn], n, k;
char s[25];
int deal(char s[], int len) {
  int st = 0, flag = 1;
  if (s[0] == '-') st++, flag = -1;
  int ret = 0;
  for (int i = st; i < len; i++) {
    ret = ret * 10 + s[i] - '0';
  }
  return ret * flag;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = (int)1; i <= (int)n; i++) {
    scanf("%s", s);
    int l = strlen(s);
    if (s[0] == '?')
      a[i] = inf;
    else
      a[i] = deal(s, l);
    int pos = i - (i - 1) / k * k;
    bar[pos].push_back({a[i], i});
  }
  for (int i = 1; i <= k; i++) {
    bar[i].push_back({inf + 2, 0});
  }
  int flag = 0;
  for (int i = 1; i <= k; i++) {
    int pre = -(int)2e9 - 1;
    tmp.clear();
    for (int j = 0; j < bar[i].size(); j++) {
      int aim = bar[i][j].first;
      if (aim == inf) {
        tmp.push_back(bar[i][j].second);
      } else {
        if (aim <= pre) {
          flag = 1;
          break;
        }
        int can = aim - pre - 1;
        if (can < tmp.size()) {
          flag = 1;
          break;
        }
        if (aim <= 0) {
          for (int k = tmp.size() - 1, val = aim - 1; k >= 0; k--, val--) {
            a[tmp[k]] = val;
          }
          tmp.clear();
        } else {
          if (pre < 0) {
            int sz = tmp.size(), fir = aim - sz, gre = -(sz - 1) / 2;
            if (fir > gre) {
              fir = max(pre + 1, gre);
            }
            for (int k = 0, val = fir; k < sz; k++, val++) {
              a[tmp[k]] = val;
            }
            tmp.clear();
          } else {
            for (int k = 0, val = pre + 1; k < tmp.size(); k++, val++) {
              a[tmp[k]] = val;
            }
            tmp.clear();
          }
        }
        pre = aim;
      }
    }
    if (flag) break;
  }
  if (flag) return 0 * printf("Incorrect sequence\n");
  for (int i = 1; i <= n; i++) {
    printf("%d%c", a[i], i == n ? '\n' : ' ');
  }
  return 0;
}
