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 cnt[N];
long long a[N];
long long sum[N];
long long ABS(long long x) { return x < 0 ? -x : x; }
int find() {
  for (int i = k; i <= n; i++)
    if (cnt[i] - cnt[i - k] == 0) return i;
  return -1;
}
int main() {
  scanf("%d%d", &n, &k);
  memset(a, 0, sizeof(a));
  memset(vis, 0, sizeof(vis));
  memset(cnt, 0, sizeof(cnt));
  memset(sum, 0, sizeof(sum));
  for (int i = 1; i <= n; i++) {
    char s[15];
    scanf("%s", s);
    if (s[0] == '?')
      vis[i]++;
    else
      sscanf(s, "%I64d", &a[i]);
    cnt[i] = cnt[i - 1] + vis[i];
    sum[i] = sum[i - 1] + a[i];
  }
  int flag = 0;
  if (find() == -1) {
    for (int i = k + 1; i <= n; i++) {
      if (vis[i]) a[i] = a[i - k] + 1;
      if (a[i] > 1e9) a[i] = 1e9;
    }
    int f = 0;
    for (int i = n - k; i >= 1; i--) {
      if (vis[i]) a[i] = a[i + k] - 1;
      if (a[i] < -1e9) flag = 1;
    }
    for (int i = 0; i <= n; i++) vis[i] = 0;
    for (int i = 1; i <= n; i++) cnt[i] = cnt[i - 1] + vis[i];
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
    for (int i = k + 1; i <= n; i++)
      if (sum[i] - sum[i - k] <= sum[i - 1] - sum[i - 1 - k]) flag = 1;
  } else {
    int in = find();
    long long minn = 1LL << 34;
    for (int i = in - k; i >= 1; i--) {
      if (vis[i]) {
        a[i] = a[i + k] - 1;
        minn = min(minn, a[i]);
      }
    }
    if (minn >= 0) {
      for (int i = in - k; i >= 1; i--)
        if (vis[i]) a[i] = 0;
      for (int i = k + 1; i <= in; i++)
        if (vis[i]) a[i] = a[i - k] + 1;
    }
    for (int i = 0; i <= in; i++) vis[i] = 0;
    for (int i = n; i >= k; i--)
      if (cnt[i] - cnt[i - k] == 0) in = i;
    for (int i = in + 1; i <= n; i++) {
      if (vis[i]) a[i] = a[i - k] + 1;
      if (a[i] > 1e9) flag = 1;
      vis[i] = 0;
    }
    for (int i = 1; i <= n; i++) cnt[i] = cnt[i - 1] + vis[i];
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  }
  int in = k + 1;
  for (int i = k + 1; i <= n && !flag; i++) {
    if (cnt[i] - cnt[i - k] == 0) {
      if (in > k) {
        long long up = sum[i] - sum[i - k];
        long long down = sum[in - 1] - sum[in - k - 1];
        if (up - down <= i - in) flag = 1;
        if (flag) break;
        long long tot1 = 0, tot2 = 0;
        for (int j = in; j <= i - k; j++) {
          if (vis[j]) tot1 += ABS(a[j - k] + 1);
        }
        for (int j = i - k; j >= in; j--) {
          if (vis[j]) tot2 += ABS(a[j + k] - 1);
        }
        if (tot1 <= tot2)
          for (int j = in; j <= i - k; j++) {
            if (vis[j]) a[j] = a[j - k] + 1;
          }
        else
          for (int j = i - k; j >= in; j--) {
            if (vis[j]) a[j] = a[j + k] - 1;
          }
      }
      in = i + 1;
    }
  }
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  for (int i = k + 1; i <= n; i++)
    if (sum[i] - sum[i - k] <= sum[i - 1] - sum[i - 1 - k]) flag = 1;
  if (flag)
    puts("Incorrect sequence");
  else
    for (int i = 1; i <= n; i++) cout << a[i] << endl;
  return 0;
}
