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 bs[10];
int n, k;
long long undef = -((long long)(1) << 55);
vector<long long> g[100000];
int parseInt(const string& s) {
  int ans = 0;
  for (int i = s.length() - 1; i >= 0; i--) {
    if (s[i] == '-') {
      ans = -ans;
    } else {
      ans += bs[s.length() - 1 - i] * (s[i] - int('0'));
    }
  }
  return ans;
}
void go(int pt) {
  long long prev = undef;
  for (int i = 0; i < g[pt].size(); i++) {
    if (g[pt][i] != undef) {
      if (g[pt][i] > prev) {
        prev = g[pt][i];
      } else {
        printf("Incorrect sequence");
        exit(0);
      }
    }
  }
  int lf = -1;
  int rg = -1;
  while (lf < (int)g[pt].size() || rg < (int)g[pt].size()) {
    while (lf + 1 < g[pt].size() && g[pt][lf + 1] != undef) {
      lf++;
    }
    if (lf == g[pt].size() - 1) break;
    while (rg + 1 < g[pt].size() && (rg <= lf || g[pt][rg + 1] == undef)) {
      rg++;
    }
    rg++;
    long long lfbound, rgbound;
    if (lf == -1) {
      lfbound = undef;
    } else {
      lfbound = g[pt][lf] + 1;
    }
    if (rg == g[pt].size()) {
      rgbound = -undef;
    } else {
      rgbound = g[pt][rg] - 1;
    }
    if (rgbound - lfbound + 1 < rg - lf - 1) {
      printf("Incorrect sequence");
      exit(0);
    }
    int pflf = -(rg - lf - 1) / 2;
    int pfrg = (rg - lf - 1) / 2 + ((rg - lf - 1) % 2 == 0);
    if (pflf < lfbound) {
      for (int i = lf + 1; i < rg; i++) {
        g[pt][i] = lfbound++;
      }
      continue;
    } else if (pfrg > rgbound) {
      for (int i = rg - 1; i > lf; i--) {
        g[pt][i] = rgbound--;
      }
      continue;
    } else {
      for (int i = lf + 1; i < rg; i++) {
        g[pt][i] = pflf++;
      }
      continue;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  bs[0] = 1;
  for (int i = 1; i < 10; i++) bs[i] = bs[i - 1] * 10;
  cin >> n >> k;
  string s;
  for (int i = 0; i < n; i++) {
    cin >> s;
    if (s == "?") {
      g[i % k].push_back(undef);
    } else {
      g[i % k].push_back(parseInt(s));
    }
  }
  for (int i = 0; i < k; i++) {
    go(i);
  }
  for (int i = 0; i < n; i++) {
    printf("%I64d ", g[i % k][i / k]);
  }
  return 0;
}
