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 = 1e5 + 9;
const long long inf = -1e15;
bool mark[maxn];
long long arr[maxn];
char s[111];
long long sol() {
  long long fu = 1;
  long long d = 0;
  if (s[0] == '-') {
    fu = -1;
    d++;
  }
  long long g = 0;
  for (; s[d]; d++) {
    g *= 10;
    g += s[d] - '0';
  }
  g *= fu;
  return g;
}
long long n, k;
queue<long long> pos;
long long ttt[maxn];
bool t;
void cal(long long chu, long long zhong, long long len) {
  if (!len) return;
  for (long long i = 0, e = -(len >> 1); i < len; i++, e++) {
    ttt[i] = e;
  }
  if (chu == inf && zhong == inf) {
    return;
  }
  if (chu == inf) {
    if (zhong <= ttt[len - 1]) {
      long long f = ttt[len - 1] - zhong + 1ll;
      for (long long i = 0; i < len; i++) {
        ttt[i] -= f;
      }
    }
    return;
  }
  if (zhong == inf) {
    if (chu >= ttt[0]) {
      long long f = chu - ttt[0] + 1;
      for (long long i = 0; i < len; i++) {
        ttt[i] += f;
      }
    }
    return;
  }
  if (zhong - chu - 1 < len) {
    t = 0;
    return;
  }
  if (chu >= 0) {
    for (long long i = 0; i < len; i++) {
      ttt[i] = chu + 1 + i;
    }
  } else if (zhong <= 0) {
    for (long long i = len - 1, e = 1; i >= -1; i--, e++) {
      ttt[i] = zhong - e;
    }
  } else {
    if (chu >= ttt[0]) {
      long long f = chu - ttt[0] + 1;
      for (long long i = 0; i < len; i++) {
        ttt[i] += f;
      }
    }
    if (zhong <= ttt[len - 1]) {
      long long f = ttt[len - 1] - zhong + 1ll;
      for (long long i = 0; i < len; i++) {
        ttt[i] -= f;
      }
    }
  }
}
void chuli() {
  int d = 0;
  while (!pos.empty()) {
    long long f = pos.front();
    pos.pop();
    arr[f] = ttt[d++];
  }
}
int main() {
  long long a, b, c, d, e, f, g, h;
  ios::sync_with_stdio(0);
  while (cin >> n >> k) {
    memset(mark, 0, sizeof(mark));
    for (d = 1; d <= n; d++) {
      cin >> s;
      if (s[0] == '?') {
        mark[d] = 1;
      } else {
        arr[d] = sol();
      }
    }
    t = 1;
    for (d = 1; d <= k; d++) {
      g = h = 0;
      for (e = d; e <= n; e += k) {
        if (!mark[e]) {
          g = 1;
          break;
        }
        pos.push(e);
      }
      if (!g) {
        cal(inf, inf, pos.size());
        chuli();
        continue;
      }
      cal(inf, arr[e], pos.size());
      chuli();
      f = arr[e];
      for (e += k; e <= n; e += k) {
        if (mark[e]) {
          pos.push(e);
        } else {
          cal(f, arr[e], pos.size());
          chuli();
          f = arr[e];
        }
      }
      cal(f, inf, pos.size());
      chuli();
    }
    for (d = 1; d <= k && t; d++) {
      for (e = d + k; e <= n; e += k) {
        if (arr[e] <= arr[e - k]) {
          t = 0;
          break;
        }
      }
    }
    if (t) {
      cout << arr[1];
      for (d = 2; d <= n; d++) {
        cout << ' ' << arr[d];
      }
      cout << endl;
    } else {
      cout << "Incorrect sequence" << endl;
    }
  }
  return 0;
}
