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 double EPS = (double)1e-9;
const double PI = (double)acos(-1.0);
int irand(int lo, int hi) {
  return (((double)rand()) / (RAND_MAX + 1.0)) * (hi - lo + 1) + lo;
}
string toString(long long x) {
  stringstream ss;
  ss << x;
  return ss.str();
}
long long toNumber(string S) {
  long long ret;
  sscanf(S.c_str(), "%lld", &ret);
  return ret;
}
const int INF = (int)2e9;
const long long MOD = (long long)1e9 + 7;
long long input(int i, vector<int>& pos) {
  char s[15];
  scanf("%s", s);
  if (s[0] == '?') {
    pos.push_back(i);
    return (long long)1e10;
  }
  long long res;
  sscanf(s, "%lld\n", &res);
  return res;
}
long long dat[100005];
long long pre[100005];
int main() {
  int res = 1;
  int n, k;
  scanf("%d %d", &n, &k);
  vector<int> poss;
  poss.clear();
  dat[0] = pre[0] = 0;
  for (int i = 1; i <= n; i += 1) dat[i] = input(i, poss);
  for (int pos : poss) {
    if (dat[pos] != (long long)1e10) continue;
    long long lo = (long long)-1e18;
    if (pos > k) lo = dat[pos - k] + 1;
    int cnt = 0;
    long long hi = (long long)1e18;
    for (int i = pos; i <= n; i += k, cnt++)
      if (dat[i] != (long long)1e10) {
        hi = dat[i] - 1;
        break;
      }
    if (hi - lo + 1 < cnt) {
      res = 0;
      break;
    }
    if (hi - lo + 1 >= cnt) {
      if (lo <= 0 && 0 <= hi) {
        lo = -(cnt >> 1);
        hi = (cnt - 1) >> 1;
      }
      if (lo < 0 && hi < 0) lo = hi - cnt + 1;
      if (0 < lo && 0 < hi) hi = lo + cnt - 1;
    }
    for (int i = pos; lo <= hi; i += k, lo++) dat[i] = lo;
  }
  for (int i = 1; i <= n; i += 1) pre[i] = pre[i - 1] + dat[i];
  long long prev = (long long)-1e18;
  for (int i = k; i <= n; i += 1) {
    if (prev >= pre[i] - pre[i - k]) res = 0;
    prev = pre[i] - pre[i - k];
  }
  if (!res) puts("Incorrect sequence");
  if (res)
    for (int i = 1; i <= n; i += 1) printf("%lld%c", dat[i], " \n"[i == n]);
  return 0;
}
