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;
const int MIN = (int)(-1e9 - 2e5);
const int MAX = (int)(+1e9 + 2e5);
vector<int> get(int lower, int upper, int n) {
  vector<int> res(n);
  if (lower >= 0) {
    for (int i = 0; i < n; ++i) {
      res[i] = lower + 1 + i;
    }
  } else if (upper <= 0) {
    for (int i = 0; i < n; ++i) {
      res[n - 1 - i] = upper - 1 - i;
    }
  } else {
    int left = max(0, n - upper), right = min(n - 1, -lower - 1);
    int middle = (n - 1) / 2, pos;
    if (left <= middle && middle <= right) {
      pos = middle;
    } else if (right < middle) {
      pos = right;
    } else {
      pos = left;
    }
    for (int i = 0; i < n; ++i) {
      res[i] = i - pos;
    }
  }
  return res;
}
bool solve(int n, int k, vector<int>& array, vector<bool>& flag) {
  for (int i = 0; i < k; ++i) {
    for (int st = i, ed; st < n; st = ed) {
      for (ed = st + k; ed < n; ed += k) {
        if (flag[ed]) {
          break;
        }
      }
      if (ed >= n) {
        continue;
      }
      int cnt = (ed - st) / k - 1;
      if (array[ed] - array[st] - 1 < cnt) {
        return false;
      }
      vector<int> buf = get(array[st], array[ed], cnt);
      for (int j = 0; j < cnt; ++j) {
        array[st + k + j * k] = buf[j];
      }
    }
  }
  return true;
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> array(n + 2 * k);
  vector<bool> flag(n + 2 * k);
  for (int i = 0; i < k; ++i) {
    flag[i] = true;
    array[i] = MIN;
  }
  for (int i = k; i < n + k; ++i) {
    string buf;
    cin >> buf;
    if (buf == "?") {
      flag[i] = false;
    } else {
      flag[i] = true;
      sscanf(buf.c_str(), "%d", &array[i]);
    }
  }
  for (int i = n + k; i < n + 2 * k; ++i) {
    flag[i] = true;
    array[i] = MAX;
  }
  if (solve(n + 2 * k, k, array, flag)) {
    for (int i = k; i < n + k; ++i) {
      cout << array[i] << (i == n + k - 1 ? "\n" : " ");
    }
  } else {
    cout << "Incorrect sequence" << endl;
  }
  return 0;
}
