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;
class Solution {
 public:
  const int UNKNOWN = numeric_limits<int>::min();
  void solve(std::istream& in, std::ostream& out) {
    int n, k;
    in >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
      string s;
      in >> s;
      if (s[0] == '?')
        a[i] = UNKNOWN;
      else {
        istringstream is(s);
        is >> a[i];
      }
    }
    for (int i = 0; i < k; ++i) {
      vector<int> u;
      for (int j = i; j < n; j += k) u.push_back(a[j]);
      if (!solve(u)) {
        out << "Incorrect sequence" << endl;
        return;
      }
      for (int j = i, t = 0; t < u.size(); j += k, ++t) {
        a[j] = u[t];
      }
    }
    for (int i : a) out << i << " ";
    out << endl;
  }
  bool solve(vector<int>& a) {
    const int n = a.size();
    int first = 0;
    while (first < n && a[first] == UNKNOWN) ++first;
    if (first == n) {
      first = -(n / 2);
      for (int i = 0; i < n; ++i) a[i] = first++;
      return true;
    }
    vector<int> prefix = solveOneSide(first, a[first]);
    if (prefix.size() != first) return false;
    for (int i = 0; i < first; ++i) a[i] = prefix[i];
    while (true) {
      int next = first + 1;
      while (next < n && a[next] == UNKNOWN) {
        ++next;
      }
      if (next == n) {
        vector<int> suffix = solveOneSide(n - first - 1, -a[first]);
        if (suffix.size() != n - first - 1) return false;
        for (int i = 0; i < n - first - 1; ++i) {
          a[n - i - 1] = -suffix[i];
        }
        return true;
      }
      if (a[first] >= a[next]) return false;
      vector<int> infix = solveTwoSide(a[first], next - first - 1, a[next]);
      if (infix.size() != next - first - 1) return false;
      for (int i = 0; i < next - first - 1; ++i) a[first + i + 1] = infix[i];
      first = next;
    }
  }
  vector<int> solveOneSide(int sz, int last) {
    vector<int> res(sz);
    if (sz == 0) return res;
    last = min(last - 1, sz / 2);
    for (int i = sz - 1; i >= 0; --i) res[i] = last--;
    return res;
  }
  vector<int> solveTwoSide(int first, int sz, int last) {
    vector<int> res(sz);
    if (sz == 0 || last - first < sz + 1) return res;
    if (last <= 0) {
      for (int i = sz - 1; i >= 0; --i) res[i] = --last;
      return res;
    }
    if (first >= 0) {
      for (int i = 0; i < sz; ++i) res[i] = ++first;
      return res;
    }
    set<int> nums;
    nums.insert(0);
    for (int i = 1; nums.size() < sz; ++i) {
      if (i < last) nums.insert(i);
      if (-i > first) nums.insert(-i);
    }
    std::copy(nums.begin(), nums.end(), res.begin());
    return res;
  }
};
void solve(std::istream& in, std::ostream& out) {
  out << std::setprecision(12);
  Solution solution;
  solution.solve(in, out);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  istream& in = cin;
  ostream& out = cout;
  solve(in, out);
  return 0;
}
