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;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int maxn = 100010;
int n, k;
char s[20];
int a[maxn];
bool flag[maxn];
void solve() {
  memset(a, 0, sizeof(a));
  memset(flag, 0, sizeof(flag));
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    if (s[0] == '?')
      flag[i + 1] = 1;
    else {
      bool neg = false;
      if (s[0] == '-') neg = true;
      for (int j = neg; j < strlen(s); j++) a[i] = a[i] * 10 + s[j] - '0';
      if (neg) a[i] *= -1;
    }
  }
  for (int i = 0; i < k; i++) {
    vector<int> pos;
    vector<pair<int, int> > tmp;
    tmp.push_back(make_pair(INT_MIN / 2, 0));
    pos.push_back(0);
    for (int j = i; j < n; j += k) {
      if (!flag[j + 1]) {
        pos.push_back(int((tmp).size()));
      }
      tmp.push_back(make_pair(a[j], j));
    }
    pos.push_back(int((tmp).size()));
    tmp.push_back(make_pair(INT_MAX / 2, 0));
    for (int j = 0; j < int((pos).size()) - 1; j++) {
      int k = pos[j + 1] - pos[j] - 1;
      int u = tmp[pos[j]].first + 1;
      int v = tmp[pos[j + 1]].first - 1;
      if (v - u + 1 < k) {
        printf("Incorrect sequence");
        return;
      }
      if (u >= 0) {
        int cnt = 0;
        for (int l = pos[j] + 1; l < pos[j + 1]; l++)
          a[tmp[l].second] = u + (cnt++);
      } else if (v <= 0) {
        int cnt = 0;
        for (int l = pos[j] + 1; l < pos[j + 1]; l++)
          a[tmp[l].second] = v - k + (++cnt);
      } else {
        vector<int> w;
        w.push_back(0);
        for (int l = 1; l < k; l++) {
          if (int((w).size()) == k) break;
          if (l >= u && l <= v) w.push_back(l);
          if (int((w).size()) == k) break;
          if (-l >= u && -l <= v) w.push_back(-l);
        }
        sort(w.begin(), w.end());
        int cnt = 0;
        for (int l = pos[j] + 1; l < pos[j + 1]; l++)
          a[tmp[l].second] = w[cnt++];
      }
    }
  }
  for (int i = 0; i < n - k; i++)
    if (a[i] >= a[i + k]) {
      printf("Incorrect sequence");
      return;
    }
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
}
int main() {
  solve();
  return 0;
}
