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>
#pragma comment(linker, "/STACK:100000000000000")
using namespace std;
long long n, k, arr[100011];
long long sum[100011];
string st;
long long chng() {
  long long num = 0;
  for (long long i = st[0] == '-'; i < st.size(); i++) {
    num *= 10;
    num += st[i] - 48;
  }
  if (st[0] == '-') num *= -1;
  return num;
}
vector<long long> vec;
vector<bool> hl;
int main() {
  cin >> n >> k;
  char ch;
  for (long long i = 0; i < n; i++) {
    cin >> st;
    if (st == "?")
      arr[i] = 1000000007;
    else
      arr[i] = chng();
  }
  if (arr[0] != 1000000007) sum[0] = arr[0];
  for (long long i = 1; i < n; i++) {
    sum[i] = sum[i - 1];
    if (arr[i] != 1000000007) sum[i] += arr[i];
  }
  for (long long i = 0; i < k; i++) {
    vec.clear();
    hl.clear();
    for (long long j = i; j < n; j += k) {
      vec.push_back(arr[j]);
      if (arr[j] == 1000000007)
        hl.push_back(0);
      else
        hl.push_back(1);
    }
    long long l = -(1ll << 60), s = 0;
    while (s < vec.size()) {
      long long ind = -1, len = 0;
      for (long long j = s; j < vec.size(); j++)
        if (vec[j] != 1000000007) {
          ind = j;
          break;
        } else
          len++;
      long long num = 0;
      if (ind == -1) {
        int x = len / 2;
        if (-x > l)
          num = -x;
        else
          num = l + 1;
        for (long long j = s; j < vec.size(); j++) vec[j] = num++;
        s = vec.size();
      } else {
        int x = -(len / 2);
        num = vec[ind] - len;
        if (x <= num && x > l)
          num = -x;
        else
          num = min(max(0ll, l + 1), num);
        l = vec[ind];
        for (long long j = ind - len; j < ind; j++) vec[j] = num++;
        s = ind + 1;
      }
    }
    for (long long j = i, z = 0; j < n; j += k, z++) arr[j] = vec[z];
    for (long long i = 0; i < vec.size() - 1; i++)
      if (vec[i] >= vec[i + 1]) {
        printf("Incorrect sequence\n");
        return 0;
      }
  }
  for (long long i = 0; i < n; i++) cout << arr[i] << ' ';
  return 0;
}
