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 Maxn = 100000 + 10;
int n, k;
int a[Maxn];
bool q[Maxn];
vector<int> vec[Maxn];
int abs(int h);
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    string h;
    cin >> h;
    if (h[0] == '?') {
      q[i] = true;
      continue;
    }
    int m = 1;
    if (h[0] == '-') m *= -1;
    for (int j = (m == 1 ? 0 : 1); j < h.size(); j++) {
      a[i] *= 10;
      a[i] += h[j] - '0';
    }
    a[i] *= m;
  }
  for (int i = 0; i < k; i++) {
    int beg = -1000100001, begid = i - k, end, endid;
    for (int j = i; j < n + k; j += k)
      if (!q[j] || j >= n) {
        end = 1000100001;
        if (j < n) end = a[j];
        endid = j;
        if (beg >= 0)
          for (int h = begid + k; h < endid; h += k)
            a[h] = (h > begid + k ? a[h - k] + 1 : beg + 1);
        else if (end <= 0)
          for (int h = endid - k; h > begid; h -= k)
            a[h] = (h < begid - k ? a[h + k] - 1 : end - 1);
        else {
          deque<int> deq;
          deq.push_back(0);
          for (int h = 1; deq.size() < (endid - begid - k) / k; h++) {
            if (h < end) deq.push_back(h);
            if (-h > beg) deq.push_front(-h);
            if (h >= end && -h <= beg) {
              cout << "Incorrect sequence" << endl;
              return 0;
            }
          }
          for (int h = begid + k; h < endid; h += k) {
            a[h] = deq.front();
            deq.pop_front();
          }
        }
        if (j < n) beg = a[j];
        begid = j;
      }
  }
  for (int i = 0; i < k; i++)
    for (int j = i; j < n - k; j += k)
      if (a[j + k] - a[j] < 1) {
        cout << "Incorrect sequence" << endl;
        return 0;
      }
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
int abs(int h) {
  if (h > 0) return h;
  return (h * -1);
}
