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 N = 1e5 + 23, inf = 0x3f3f3f3f;
long long a[N];
inline long long inp() {
  long long c = getchar(), x = 0;
  bool neg = 0;
  for (; ((c < 48 or c > 57) and c != '-' and c != '?'); c = getchar())
    ;
  if (c == '?') return inf;
  if (c == '-') neg = 1, c = getchar();
  for (; c > 47 and c < 58; c = getchar()) x = (x << 1) + (x << 3) + c - 48;
  return neg ? -x : x;
}
bool fix(long long st, long long en, long long n, long long k) {
  long long lo = (st < 0 ? -inf : a[st]) + 1;
  long long hi = (en >= n ? inf : a[en]) - 1;
  long long num = (en - st) / k - 1;
  if (hi - lo + 1 < num) return false;
  if (lo >= 0) {
    for (long long i = st + k; i < en; i += k) a[i] = lo++;
    return true;
  }
  if (hi <= 0) {
    for (long long i = en - k; i > st; i -= k) a[i] = hi--;
    return true;
  }
  long long fst = (num - 1) / 2;
  long long snd = num / 2;
  if (fst > abs(lo)) {
    snd += fst - abs(lo);
    fst = abs(lo);
  } else if (snd > hi) {
    fst += snd - hi;
    snd = hi;
  }
  long long cur = -fst;
  for (long long i = st + k; i < en; i += k) a[i] = cur++;
  return true;
}
bool go(long long r, long long n, long long k) {
  long long prev = r - k;
  for (long long i = r; i < n; i += k) {
    if (a[i] < inf) {
      if (prev >= 0 and a[prev] >= a[i]) return false;
      prev = i;
      continue;
    }
    while (i < n and a[i] == inf) i += k;
    bool can = fix(prev, i, n, k);
    if (!can) return false;
    prev = i;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n = inp(), k = inp();
  for (long long i = 0; i < n; i++) a[i] = inp();
  for (long long i = 0; i < k; i++)
    if (!go(i, n, k)) {
      cout << "Incorrect sequence\n";
      return 0;
    }
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  cout << "\n";
  return 0;
}
