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;
vector<vector<long long> > DP;
long long N, k;
long long INF = 10000000000;
long long sstoi(string s) {
  bool ok = 0;
  if (s[0] == '-') {
    ok = 1;
    s.erase(0, 1);
  }
  long long ans = 0;
  long long i, j, k;
  j = 1;
  for (i = s.size() - 1; i >= 0; i--) {
    ans += (s[i] - '0') * j;
    j *= 10;
  }
  if (ok == 1) ans = -ans;
  return ans;
}
bool FL(long long n, long long x) {
  long long i, j, n1, n2, n3;
  n1 = (x - 1) / 2;
  if (DP[n][x] > n1)
    n1 = n1;
  else
    n1 = DP[n][x] - 1;
  for (i = x - 1; i >= 0; i--) {
    DP[n][i] = n1;
    n1--;
  }
  return 1;
}
bool FF(long long n, long long x, long long y) {
  if (x + 1 == y) {
    if (DP[n][y] < DP[n][x]) return 0;
    return 1;
  }
  long long i, j, k, n1, n2, n3, m, L, R;
  m = (y - x - 1);
  if (DP[n][x] + m + 1 > DP[n][y]) return 0;
  L = -m / 2;
  R = m / 2;
  if (DP[n][x] >= L) {
    for (i = x + 1; i < y; i++) {
      DP[n][i] = DP[n][x] + (i - x);
    }
  } else if (DP[n][y] <= R) {
    for (i = y - 1; i > x; i--) {
      DP[n][i] = DP[n][y] - (y - i);
    }
  } else {
    n1 = L;
    for (i = x + 1; i < y; i++) {
      DP[n][i] = n1;
      n1++;
    }
  }
  return 1;
}
bool FR(long long n, long long y) {
  long long i, j, k, n1, n2, n3, m, L, R, LL;
  LL = DP[n].size();
  m = (LL - y - 1);
  L = -m / 2;
  R = m / 2;
  if (DP[n][y] >= L) L = DP[n][y] + 1;
  for (i = y + 1; i < LL; i++) {
    DP[n][i] = L;
    L++;
  }
  return 1;
}
bool calculate(long long n) {
  long long i, j, k, n1, n2, n3, L, R;
  j = 0;
  while (j < DP[n].size() && DP[n][j] == INF) j++;
  if (j == DP[n].size()) {
    n1 = DP[n].size();
    n2 = n1 / 2;
    n3 = -n1 / 2;
    if (n2 > N) {
      n3 = N - (n1 - 1);
    }
    for (i = 0; i < DP[n].size(); i++) {
      DP[n][i] = n3;
      n3++;
    }
    return 1;
  }
  L = j;
  if (FL(n, L) == 0) return 0;
  for (i = L + 1; i < DP[n].size(); i++) {
    if (DP[n][i] == INF) continue;
    R = i;
    if (FF(n, L, R) == 0) return 0;
    L = R;
  }
  if (DP[n][DP[n].size() - 1] == INF) {
    if (FR(n, L) == 0) return 0;
  }
  return 1;
}
bool solve() {
  long long i;
  for (i = 0; i < k; i++) {
    if (DP[i].size() == 0) continue;
    if (calculate(i) == 0) return 0;
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(false);
  long long i, j, n1, n2, n3;
  cin >> N >> k;
  string s;
  DP.resize(k);
  bool ok = 0;
  for (i = 0; i < N; i++) {
    cin >> s;
    if (s == "?")
      DP[(i % k)].push_back(INF);
    else {
      j = sstoi(s);
      DP[(i % k)].push_back(j);
    }
  }
  if (solve() == 0)
    cout << "Incorrect sequence" << endl;
  else {
    for (i = 0; i < N; i++) {
      if (i != 0) cout << ' ';
      cout << DP[i % k][i / k];
    }
    cout << endl;
  }
  return 0;
}
