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 N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[N], n, k;
int in(string s) {
  if (s[0] == '?')
    return INF;
  else {
    int ans = 0, flag = 0;
    for (int i = 0; i < (int)(s.size()); i++) {
      if (s[i] == '-')
        flag = 1;
      else
        ans = 10 * ans + s[i] - '0';
    }
    return flag ? -ans : ans;
  }
}
long long getsum(int start, int n) {
  long long ans = 0;
  for (int i = 0; i < (int)(n); i++) {
    ans += abs(start++);
  }
  return ans;
}
int main() {
  ios ::sync_with_stdio(0);
  cin >> n >> k;
  string s;
  for (int i = (int)(1); i <= (int)(n); i++) {
    cin >> s;
    a[i] = in(s);
  }
  bool bad = 0;
  for (int i = (int)(1); i <= (int)(k); i++) {
    int j = i;
    vector<int> tmp;
    while (j <= n) {
      tmp.push_back(a[j]);
      j += k;
    }
    for (int t = 0; t < (int)(tmp.size()); t++) {
      if (tmp[t] == INF) {
        int now = t;
        while (now < (int)tmp.size() && tmp[now] == INF) {
          now++;
        }
        if (now == (int)tmp.size()) {
          int st = -(now - t - 1) / 2;
          if (t) {
            st = max(tmp[t - 1] + 1, st);
          }
          for (int r = (int)(t); r <= (int)(tmp.size() - 1); r++) {
            a[i + k * r] = st++;
          }
        } else {
          if (t == 0) {
            int st = -(now - t) / 2;
            int ed = st + now - t - 1;
            ed = min(ed, tmp[now] - 1);
            for (int r = now - 1; r >= t; r--) {
              a[i + k * r] = ed--;
            }
          } else {
            int left = tmp[t - 1], right = tmp[now];
            if (right - left <= now - t) {
              bad = 1;
              break;
            }
            int lo = left + 1, hi = right - (now - t);
            while (lo + 5 < hi) {
              int mid1 = (2LL * lo + hi) / 3;
              int mid2 = (lo + 2LL * hi) / 3;
              long long sum1 = getsum(mid1, now - t),
                        sum2 = getsum(mid2, now - t);
              if (sum1 >= sum2) {
                lo = mid1;
              } else {
                hi = mid2;
              }
            }
            long long ans = 1LL << 60;
            int id = INF;
            for (int i = (int)(lo); i <= (int)(hi); i++) {
              long long tmp = 0;
              int tt = i;
              for (int j = (int)(t); j <= (int)(now - 1); j++) {
                tmp += abs(tt++);
              }
              if (tmp < ans) {
                ans = tmp;
                id = i;
              }
            }
            lo = id;
            for (int r = (int)(t); r <= (int)(now - 1); r++) {
              a[i + k * r] = lo++;
            }
          }
        }
        t = now - 1;
      }
    }
    if (bad) break;
  }
  if (!bad) {
    for (int i = (int)(1); i <= (int)(n); i++) {
      if (i + k <= n && a[i] >= a[i + k]) {
        bad = 1;
        break;
      }
    }
  }
  if (bad) {
    cout << "Incorrect sequence" << endl;
  } else {
    for (int i = (int)(1); i <= (int)(n); i++) {
      cout << a[i] << " \n"[i == n];
    }
  }
  return 0;
}
