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;
ifstream fin("in.in");
ofstream fout("out.out");
const int N = 1e5 + 10, inf = 1e9 + 10;
int n, k;
vector<int> a[N];
vector<pair<int, int> > b[N];
bool sameSign(int r, int i, int j) {
  return (b[r][i].first <= 0 && b[r][j].first <= 0 ||
          b[r][i].first >= 0 && b[r][j].first >= 0);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    string in;
    int x = 0;
    cin >> in;
    if (in[0] != '?') {
      int sgn = (in[0] == '-') ? -1 : 1;
      int fst = sgn < 0;
      for (int j = fst; j < in.length(); j++) x = 10 * x + (in[j] - '0');
      b[i % k].push_back(make_pair(sgn * x, i / k));
    }
  }
  for (int r = 0; r < min(k, n); r++) {
    if (b[r].empty()) {
      int num = n / k + (r <= ((n - 1) % k));
      int x = ceil(double(n - 1) / 2), y = (n - 1) / 2;
      for (int i = x; i <= y; i++) a[r].push_back(i);
      continue;
    }
    int num = b[r][0].second;
    if (b[r][0].first <= 0) {
      for (int i = b[r][0].first - num; i < b[r][0].first; i++)
        a[r].push_back(i);
    } else {
      int mid = ceil(double(num) / 2) - 1;
      if (b[r][0].first <= mid) {
        for (int i = b[r][0].first - num; i < b[r][0].first; i++)
          a[r].push_back(i);
      } else {
        int fst = -mid - !(num & 1);
        for (int i = fst; i <= mid; i++) a[r].push_back(i);
      }
    }
    a[r].push_back(b[r][0].first);
    for (int i = 1; i < b[r].size(); i++) {
      if (b[r][i].first - b[r][i - 1].first <=
          b[r][i].second - b[r][i - 1].second - 1) {
        cout << "Incorrect sequence";
        return 0;
      }
      int cnt = b[r][i].second - b[r][i - 1].second - 1;
      if (sameSign(r, i, i - 1)) {
        if (b[r][i].first <= 0) {
          for (int j = b[r][i].first - cnt; j < b[r][i].first; j++)
            a[r].push_back(j);
        } else {
          for (int j = b[r][i - 1].first + 1; j <= b[r][i - 1].first - cnt; j++)
            a[r].push_back(j);
        }
      } else {
        int x = b[r][i].first - 1;
        int y = -b[r][i - 1].first - 1;
        int mid0 = (cnt - 1) / 2;
        int mid1 = mid0 + !(cnt & 1);
        if (min(x, y) >= mid0) {
          if (x < y) {
            for (int j = -mid1; j <= mid0; j++) a[r].push_back(j);
          } else {
            for (int j = -mid0; j <= mid1; j++) a[r].push_back(j);
          }
        } else if (x < mid0) {
          for (int j = x - cnt + 1; j <= x; j++) a[r].push_back(j);
        } else {
          for (int j = -y; j < -y + cnt; j++) a[r].push_back(j);
        }
      }
      a[r].push_back(b[r][i].first);
    }
    int sz = b[r].size() - 1;
    num = n / k - a[r].size();
    if (n % k) num += (r <= ((n - 1) % k));
    if (b[r][sz].first >= 0) {
      for (int i = b[r][sz].first + 1; i <= b[r][sz].first + num; i++)
        a[r].push_back(i);
    } else {
      int mid = ceil(double(num) / 2) - 1;
      if (b[r][sz].first >= mid) {
        for (int i = b[r][sz].first + 1; i <= b[r][sz].first + num; i++)
          a[r].push_back(i);
      } else {
        int lst = mid + !(num & 1);
        for (int i = mid; i <= lst; i++) a[r].push_back(i);
      }
    }
  }
  for (int i = 0; i < n; i++) cout << a[i % k][i / k] << ' ';
  return 0;
}
