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 = 100010;
int N, K;
vector<pair<int, bool> > seq[MAXN];
int main() {
  if (fopen("input.txt", "r")) {
    freopen("input.txt", "r", stdin);
  }
  ios::sync_with_stdio(false);
  cin >> N >> K;
  for (int i = 0; i < N; i++) {
    string s;
    cin >> s;
    if (s[0] == '?') {
      seq[i % K].push_back(make_pair(-1, false));
    } else {
      stringstream ss;
      ss << s;
      int x;
      ss >> x;
      seq[i % K].push_back(make_pair(x, true));
    }
  }
  for (int i = 0; i < K; i++) {
    seq[i].push_back(make_pair(2e9, true));
  }
  for (int i = 0; i < K; i++) {
    int prvint = -2e9, ind = -1;
    vector<pair<int, bool> > &v = seq[i];
    for (int j = 0, sz = v.size(); j < sz; j++) {
      pair<int, bool> p = v[j];
      if (p.second) {
        int cur = p.first, diff = j - ind;
        if (cur < prvint + diff) {
          cout << "Incorrect sequence\n";
          return 0;
        }
        if (cur <= 1) {
          int c = cur;
          for (int k = j - 1; k >= 0 && !v[k].second; k--) {
            v[k] = make_pair(--c, true);
          }
        } else if (prvint >= -1) {
          int c = prvint;
          for (int k = ind + 1; k < j; k++) {
            v[k] = make_pair(++c, true);
          }
        } else {
          int lt = prvint + 1, rt = cur - 1;
          int numt = diff - 1;
          if (numt % 2) {
            int t = numt / 2;
            if (lt <= -t && t <= rt) {
              int c = -t;
              for (int k = ind + 1; k < j; k++) {
                v[k] = make_pair(c++, true);
              }
            } else if (-lt < rt) {
              for (int k = ind + 1; k < j; k++) {
                v[k] = make_pair(lt++, true);
              }
            } else {
              for (int k = j - 1; k >= 0 && !v[k].second; k--) {
                v[k] = make_pair(rt--, true);
              }
            }
          } else if (numt) {
            int t2 = numt / 2, t1 = t2 - 1;
            if (lt <= -t1 && t2 <= rt) {
              int c = -t1;
              for (int k = ind + 1; k < j; k++) {
                v[k] = make_pair(c++, true);
              }
            } else if (lt <= -t2 && t1 <= rt) {
              int c = -t2;
              for (int k = ind + 1; k < j; k++) {
                v[k] = make_pair(c++, true);
              }
            } else if (-lt < rt) {
              for (int k = ind + 1; k < j; k++) {
                v[k] = make_pair(lt++, true);
              }
            } else {
              for (int k = j - 1; k >= 0 && !v[k].second; k--) {
                v[k] = make_pair(rt--, true);
              }
            }
          }
        }
        ind = j;
        prvint = cur;
      }
    }
  }
  for (int i = 0; i < N; i++) {
    cout << seq[i % K][i / K].first << ' ';
    assert(seq[i % K][i / K].second);
  }
}
