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;
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;
}
