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 N, K;
string buff;
long long val[100010];
long long Converti() {
  if (buff[0] == '?') return 1000000007;
  long long ris = 0, mult = (buff[0] == '-') ? -1 : 1;
  int i = (buff[0] == '-') ? 1 : 0;
  for (; i < (int)buff.size(); i++) ris = (ris * 10 + long long(buff[i] - '0'));
  return ris * mult;
}
bool Valida() {
  bool ok = true;
  for (int i = 0; i < K && ok; i++) {
    bool p = true;
    for (int j = i; j + K < N && p; j += K)
      if (val[j] >= val[j + K] || val[j] == 1000000007 ||
          val[j + K] == 1000000007)
        p = false;
    ok = p;
  }
  return ok;
}
bool Riempi(int da, int a) {
  long long sx = (da - K >= 0) ? val[da - K] : -10000000000;
  long long dx = (a < N) ? val[a] : - -10000000000;
  if (sx >= dx) return false;
  long long num = (a - da) / K;
  if (sx >= 0 && dx >= 0) {
    long long range = dx - sx - 1;
    if (num > range) return false;
    while (da < a) {
      val[da] = sx + 1;
      ++sx;
      da += K;
    }
  } else if (sx <= 0 && dx <= 0) {
    long long range = -sx + dx - 1;
    if (num > range) return false;
    int i = a - K;
    while (i >= da) {
      val[i] = dx - 1;
      --dx;
      i -= K;
    }
  } else {
    vector<long long> metto;
    long long pos = 0, neg = -1;
    for (int j = 0; j < num; j++) {
      long long ora = 0;
      if (pos >= dx && neg <= sx) return false;
      if (pos >= dx) {
        ora = neg;
        --neg;
      } else if (neg <= sx) {
        ora = pos;
        ++pos;
      } else {
        ora = (abs(pos) < abs(neg)) ? pos : neg;
        if (ora == pos)
          ++pos;
        else
          --neg;
      }
      metto.emplace_back(ora);
    }
    sort(metto.begin(), metto.end());
    for (auto i : metto) {
      val[da] = i;
      da += K;
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> N >> K;
  for (int i = 0; i < N; i++) {
    cin >> buff;
    val[i] = Converti();
  }
  for (int i = 0; i < K; i++) {
    int sx = i, dx = i;
    while (sx < N) {
      while (sx < N && val[sx] != 1000000007) sx += K;
      dx = sx;
      while (dx < N && val[dx] == 1000000007) dx += K;
      if (sx >= N) break;
      Riempi(sx, dx);
      sx = dx;
    }
  }
  if (!Valida())
    cout << "Incorrect sequence\n";
  else {
    for (int i = 0; i < N; i++) cout << val[i] << " ";
    cout << endl;
  }
  return 0;
}
