#include <bits/stdc++.h>
using namespace std;
int convert(string second) {
  int res = 0, sign = 1, beg = 0;
  if (second[0] == '-') {
    beg = 1;
    sign = -1;
  }
  for (int i = beg; i < (int)((second).size()); ++i) {
    res = res * 10 + second[i] - '0';
  }
  return res * sign;
}
vector<int> Set(int a, int b, int cnt) {
  vector<int> res;
  if (1ll * b - a - 1 < cnt) {
    cout << "Incorrect sequence";
    exit(0);
  }
  if (a >= 0 && b >= 0) {
    for (int x = a + 1; (int)((res).size()) < cnt; ++x) {
      res.push_back(x);
    }
  } else if (a <= 0 && b <= 0) {
    for (int x = b - 1; (int)((res).size()) < cnt; --x) {
      res.push_back(x);
    }
  } else {
    for (int l = 0, r = 1; (int)((res).size()) < cnt;) {
      if (l > a && (-l <= r || r == b)) {
        res.push_back(l--);
      } else {
        res.push_back(r++);
      }
    }
  }
  sort((res).begin(), (res).end());
  return res;
}
const int N = 1e5 + 5;
const int B = 1e9 + 1;
const int inf = 1 << 30;
int n, m, k, a[N], b[N];
string second;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> second;
    if (second[0] == '?') {
      a[i] = B;
    } else {
      a[i] = convert(second);
    }
  }
  for (int i = 1; i <= k; ++i) {
    b[m = 1] = -inf;
    for (int j = i; j <= n; j += k) {
      b[++m] = a[j];
    }
    b[++m] = inf;
    int stupid_prev = 1;
    for (int j = 2; j <= m; ++j) {
      if (b[j] != B) {
        vector<int> put = Set(b[stupid_prev], b[j], j - stupid_prev - 1);
        for (int l = 0; l < (int)((put).size()); ++l) {
          b[stupid_prev + 1 + l] = put[l];
        }
        stupid_prev = j;
      }
    }
    for (int j = 2; j < m; ++j) {
      a[i + (j - 2) * k] = b[j];
    }
  }
  for (int i = 1; i <= n; ++i) {
    cout << a[i] << " ";
  }
  return 0;
}
