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 = 200005;
int n, k;
int vis[N];
int pos[N];
long long a[N];
long long ABS(long long x) { return x < 0 ? -x : x; }
int get(int len, long long down, long long up, int t) {
  if (t == 1) {
    long long be = -len / 2 + len;
    if (be < up)
      return -len / 2;
    else
      return up - len;
  } else if (t == -1) {
    long long be = len / 2 - len;
    if (be > down)
      return be;
    else
      return down + 1;
  } else {
    long long be = -len / 2;
    long long tot1 = 0, tot2 = 0, tot3 = 0, now1 = down + 1, now2 = up - 1;
    for (int i = 0; i < len; i++) tot1 += ABS(now1), now1++;
    for (int i = 0; i < len; i++) tot2 += ABS(now2), now2--;
    if (down < be && -be < up) {
      for (int i = 0; i < len; i++) tot3 += be, be++;
    } else
      tot3 = 1LL << 50;
    if (tot1 <= tot2 && tot1 <= tot3) return down + 1;
    if (tot2 <= tot1 && tot2 <= tot3) return now2 + 1;
    if (tot3 <= tot1 && tot3 <= tot2) return -len / 2;
  }
}
bool work(int be) {
  int cnt = 0, num = 0;
  for (int i = be; i <= n; i += k) {
    pos[++cnt] = i;
    if (vis[i]) num++;
  }
  if (num == 0) {
    for (int i = be + k; i <= n; i += k)
      if (a[i] <= a[i - k]) return false;
    return true;
  }
  if (cnt == num) {
    int st = -cnt / 2;
    for (int i = be; i <= n; i += k) a[i] = st++;
  } else {
    if (vis[be]) {
      int len = 0;
      long long up;
      for (int i = be; i <= n; i += k)
        if (!vis[i]) {
          up = a[i];
          len = i - k;
          break;
        }
      long long st = get((len - be) / k + 1, 0, up, 1);
      for (int i = be; i < len; i += k) a[i] = st++;
    }
    if (vis[cnt]) {
      int len = 0;
      long long down;
      for (int i = cnt; i >= 1; i--) {
        int in = pos[i];
        if (!vis[in]) {
          down = a[i];
          len = i;
          break;
        }
      }
      long long st = get(cnt - len, down, 0, -1);
      for (int i = len + 1; i <= n; i++) a[pos[i]] = st++;
    }
    int last = 1;
    for (int i = 2; i <= cnt; i++) {
      int in = pos[i], on = pos[last];
      if (!vis[i]) {
        if (a[in] - a[on] - 1 < i - last - 1) return false;
        long long st = get(i - last - 1, a[on], a[in], 0);
        for (int j = last + 1; j < i; j++) a[pos[j]] = st++;
        last = i;
      }
    }
  }
  return true;
}
int main() {
  scanf("%d%d", &n, &k);
  memset(a, 0, sizeof(a));
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) {
    char s[15];
    scanf("%s", s);
    if (s[0] == '?')
      vis[i]++;
    else
      sscanf(s, "%I64d", &a[i]);
  }
  int flag = 0;
  for (int i = 1; i <= k && !flag; i++)
    if (!work(i)) flag = 1;
  if (flag)
    puts("Incorrect sequence");
  else {
    for (int i = 1; i <= n; i++) {
      if (i != 1) printf(" ");
      cout << a[i];
    }
    puts("");
  }
  return 0;
}
