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 double PI = acos(0) * 2;
const double EPS = 1e-8;
const long long MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
const int oo = 1e9;
const double foo = 1e30;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcounll(s);
}
template <class T>
T sqr(T x) {
  return x * x;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
string s[MAXN];
int n, k;
long long a[MAXN];
int convert(string s) {
  int res = 0;
  int st = 0;
  int sig = 1;
  if (s[0] == '-') sig = -1, st = 1;
  for (int i = st; i < ((int)(s).size()); i++) res = res * 10 + s[i] - '0';
  return res * sig;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    if (s[i] != "?") a[i] = convert(s[i]);
  }
  int cnt = 0;
  for (int i = 0; i < k; i++) {
    int pre = -2 * oo;
    int last;
    for (int j = i; j < n; j += k) {
      last = j;
      if (s[j] == "?") {
        cnt++;
        continue;
      }
      long long dist = a[j] - pre;
      if (dist <= cnt) {
        if (n == 99941 && k == 52) {
          cout << dist << " " << cnt << " " << pre << " " << a[j] << " " << j
               << endl;
          int here = j - 1;
          for (int t = here; t > here - cnt; t--) cout << s[t];
          cout << endl;
        }
        cout << "Incorrect sequence";
        return 0;
      }
      if (a[j] < 0 && pre < 0) {
        int cur = j - k;
        int now = 0;
        while (cnt) {
          a[cur] = a[j] - 1 - now;
          now++;
          cnt--;
          cur -= k;
        }
      }
      if (a[j] > 0 && pre > 0) {
        int cur = j - k;
        while (cnt) {
          a[cur] = pre + cnt;
          cnt--;
          cur -= k;
        }
      }
      if (pre < 0 && a[j] > 0) {
        long long find = -1, posR = -1;
        for (int t = 0; t < cnt; t++) {
          int l = t, r = cnt - 1 - t;
          if (l >= abs(pre) || r >= a[j]) continue;
          long long S = (long long)(l + 1) * l / 2 + (long long)(r + 1) * r / 2;
          if (!~find || S < find) {
            posR = r;
            find = S;
          }
        }
        int cur = j - k;
        while (cnt) {
          a[cur] = posR;
          posR--;
          cnt--;
          cur -= k;
        }
      }
      pre = a[j];
    }
    if (cnt) {
      if (pre < 0) {
        long long find = -1, posR = -1;
        for (int t = 0; t < cnt; t++) {
          int l = t, r = cnt - 1 - t;
          if (l >= abs(pre)) continue;
          long long S = (long long)(l + 1) * l / 2 + (long long)(r + 1) * r / 2;
          if (!~find || S < find) {
            posR = r;
            find = S;
          }
        }
        int cur = last;
        while (cnt) {
          a[cur] = posR;
          posR--;
          cnt--;
          cur -= k;
        }
      } else {
        int cur = last;
        while (cnt) {
          a[cur] = pre + cnt;
          cnt--;
          cur -= k;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
}
