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 MX = (1 << 20);
int to_number(string str) {
  int ret = 0, st = 0;
  if (str[0] == '-') st = 1;
  for (int j = st; j < str.length(); j++) ret *= 10, ret += str[j] - '0';
  if (st) ret *= -1;
  return ret;
}
int n, arr[MX], K, q = 0, pref = 0;
string tt;
bool is[MX];
void process(int st, vector<pair<int, int> > v) {
  int sz = (n - st) / K;
  if (v.empty()) {
    int V = -1 * sz / 2;
    for (int j = st; j <= n; j += K) arr[j] = V++;
    return;
  }
  int dif = (v[0].first - st) / K;
  int V = min(v[0].second - 1, dif / 2);
  for (int j = v[0].first - K; j > 0; j -= K) {
    arr[j] = V--, is[j] = 0;
  }
  int omar = v.size(), med, D;
  for (int j = 1; j < omar; j++) {
    dif = (v[j].first - v[j - 1].first) / K;
    if (dif - 1 > abs(v[j].second - v[j - 1].second)) {
      puts("Incorrect sequence");
      exit(0);
    }
    if (dif == 1) continue;
    med = v[j - 1].first + (dif / 2 + dif % 2) * K;
    arr[med] = 0;
    for (int i = med + K; i < v[j].first; i += K) arr[i] = arr[i - K] + 1;
    for (int i = med - K; i > v[j - 1].first; i -= K) arr[i] = arr[i + K] - 1;
    D = min(0, arr[v[j].first] - arr[v[j].first - K] - 1);
    if (!D) D = max(D, arr[v[j - 1].first] - arr[v[j - 1].first + K] + 1);
    for (int i = v[j - 1].first + K; i < v[j].first; i += K) arr[i] += D;
  }
  dif = (n - v[omar - 1].first) / K;
  V = max(v[omar - 1].second + 1, -1 * dif / 2);
  for (int j = v[omar - 1].first + K; j <= n; j += K) arr[j] = V++, is[j] = 0;
}
int main() {
  cin >> n >> K;
  for (int j = 1; j <= n; j++) {
    cin >> tt;
    if (tt == "?")
      is[j] = 1, q++;
    else
      arr[j] = to_number(tt);
  }
  for (int j = K + 1; j <= n; j++) {
    if (is[j] || is[j - K]) continue;
    if (arr[j] <= arr[j - K]) {
      puts("Incorrect sequence");
      return 0;
    }
  }
  for (int j = 1; j <= K; j++) {
    vector<pair<int, int> > v;
    int ss = 1;
    for (int i = j; i <= n; i += K) {
      if (!is[i]) {
        v.push_back(make_pair(i, arr[i]));
      }
    }
    process(j, v);
  }
  for (int j = K + 1; j <= n; j++) {
    if (is[j] && is[j - K]) continue;
    if (arr[j] <= arr[j - K]) {
      puts("Incorrect sequence");
      return 0;
    }
  }
  for (int j = 1; j <= n; j++) cout << arr[j] << ' ';
}
