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;
void dbg_out() { cerr << "\b\b]\n"; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
  cerr << H << ", ";
  dbg_out(T...);
}
vector<string> split(string s, char delim) {
  vector<string> v;
  stringstream ss(s);
  while (ss.good()) {
    string stk;
    getline(ss, stk, delim);
    if (stk.empty()) continue;
    v.push_back(stk);
  }
  return v;
}
const int INF = 2e9;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  cin >> n >> k;
  cin.get();
  string s;
  getline(cin, s);
  vector<string> X = split(s, ' ');
  vector<long long> A(n);
  vector<bool> ques(n, false);
  for (int i = 0; i < n; ++i) {
    A[i] = (X[i] == "?" ? '?' : stoi(X[i]));
    ques[i] = (X[i] == "?");
  }
  for (int i = 0; i < k; ++i) {
    vector<long long> nums;
    vector<bool> ques1;
    for (int j = i; j < n; j += k) {
      if (j > i and !ques[j] and !ques[j - k] and A[j - k] >= A[j]) {
        cout << "Incorrect sequence";
        return 0;
      }
      nums.push_back(A[j]);
      ques1.push_back(ques[j]);
    }
    for (int j = 0; j < (int)nums.size(); ++j) {
      if (!ques1[j]) continue;
      long long l = j;
      while (l < (int)nums.size() and ques1[l]) l++;
      long long left = (j ? nums[j - 1] + 1 : -INF);
      long long right = (l < (int)nums.size() ? nums[l] - 1 : INF);
      if (right - left + 1LL < l * 1LL - j) {
        cout << "Incorrect sequence";
        return 0;
      }
      if (left >= 0 and right >= 0) {
        for (int x = j; x < l; ++x) nums[x] = left++;
      } else if (left <= 0 and right <= 0) {
        for (int x = l - 1; x >= j; --x) nums[x] = right--;
      } else {
        int cnts = (l - j) / 2;
        int p = -cnts, q = cnts;
        if (left <= p and q <= right) {
          for (int x = l - 1; x >= j; --x) {
            nums[x] = cnts--;
          }
        } else if (p < left) {
          cnts = left;
          for (int x = j; x < l; ++x) nums[x] = cnts++;
        } else {
          cnts = right;
          for (int x = l - 1; x >= j; --x) {
            nums[x] = cnts--;
          }
        }
      }
      j = l - 1;
    }
    for (int x = 0, j = i; x < (int)nums.size(); ++x, j += k) {
      A[j] = nums[x];
    }
  }
  for (long long i : A) cout << i << ' ';
  return 0;
}
