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 long long INF = 10000000000000000LL;
int n, k;
long long num[100005];
long long rem[100005];
char s[1000];
inline bool chuli(int a, int b, long long x, long long y) {
  if (y - x < b - a) return 0;
  if (x >= 0)
    for (int i = a; i <= b; ++i) rem[i] = x++;
  else if (y <= 0)
    for (int i = b; i >= a; --i) rem[i] = y--;
  else {
    long long xia, shang;
    xia = max(x, -(b - a + 1) / 2LL);
    xia = min(xia, y - (b - a));
    shang = b - a + 1 + xia - 1;
    while (xia < 1) rem[a++] = xia++;
    while (shang) rem[b--] = shang--;
  }
  return 1;
}
inline bool chuli(int N) {
  long long last = -INF;
  rem[++N] = INF - 1;
  for (int i = 1; i <= N; ++i) {
    if (rem[i] != INF) {
      if (rem[i] <= last) return 0;
      last = rem[i];
    } else {
      int t = i;
      while (rem[t] == INF) ++t;
      if (!chuli(i, t - 1, last + 1, rem[t] - 1)) return 0;
      i = t - 1;
      last = rem[i];
    }
  }
  return 1;
}
bool getans() {
  int cou;
  for (int i = 1; i <= k; ++i) {
    cou = 0;
    for (int j = i; j <= n; j += k) rem[++cou] = num[j];
    if (!chuli(cou)) return 0;
    for (int j = i, x = 1; x <= cou; ++x, j += k) num[j] = rem[x];
  }
  return 1;
}
int main() {
  ios::sync_with_stdio(false);
  int t;
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> s;
    if (s[0] == '?')
      num[i] = INF;
    else {
      sscanf(s, "%d", &t);
      num[i] = t;
    }
  }
  if (getans()) {
    for (int i = 1; i <= n; ++i) cout << num[i] << ' ';
    cout << endl;
  } else
    cout << "Incorrect sequence" << endl;
  return 0;
}
