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 inline int __GET_INT() {
  int ret;
  scanf("%d", &ret);
  return ret;
}
vector<int> a;
vector<bool> isKnown;
const int inf = 2 * 1000000000;
int toInt(string str) {
  int ret = 0;
  stringstream is(str);
  is >> ret;
  return ret;
}
long long getSum(long long cnt, long long val) {
  if (val < 0) {
    val = labs(val);
    if (cnt <= (val + 1)) {
      return val * cnt - ((cnt * (cnt - 1)) / 2);
    }
    return val * val - ((val * (val - 1)) / 2) + getSum(cnt - val, 0);
  }
  return val * cnt + ((cnt * (cnt - 1)) / 2);
}
void update(int st, int nd, int k) {
  long long cnt = (nd - st) / k + 1;
  if (isKnown[st]) --cnt;
  if (st != nd && isKnown[nd]) --cnt;
  long long low = -inf, high = inf, mid1, mid2;
  if (isKnown[st]) low = a[st] + 1;
  if (isKnown[nd]) high = a[nd] - cnt;
  long long best = (1LL << 60), bestVal = -inf;
  while (low <= high) {
    long long dif = (high - low);
    dif /= 3;
    mid1 = low + dif;
    mid2 = high - dif;
    long long leftSum = getSum(cnt, mid1);
    long long rightSum = getSum(cnt, mid2);
    if (leftSum > rightSum) {
      low = mid1 + 1;
      if (rightSum < best) {
        best = rightSum;
        bestVal = mid2;
      }
    } else {
      high = mid2 - 1;
      if (leftSum < best) {
        best = leftSum;
        bestVal = mid1;
      }
    }
  }
  while (st <= nd) {
    if (!isKnown[st]) {
      a[st] = bestVal++;
    }
    st += k;
  }
}
int main() {
  int n = __GET_INT(), k = __GET_INT();
  char token[20];
  for (int i = 0; i < n; ++i) {
    scanf("%s", token);
    if (token[0] != '?') {
      a.push_back(toInt(token));
      isKnown.push_back(true);
    } else {
      a.push_back(-1);
      isKnown.push_back(false);
    }
  }
  for (int i = 0; i < k; ++i) {
    int j = i, last = i;
    while (j < n) {
      if (isKnown[j]) {
        update(last, j, k);
        last = j;
      }
      j += k;
    }
    update(last, j - k, k);
  }
  bool correct = true;
  for (int i = 0; correct && (i < k); ++i) {
    int j = i + k;
    while (j < n) {
      if (a[j] <= a[j - k]) {
        correct = false;
        break;
      }
      j += k;
    }
  }
  if (correct) {
    for (int i = 0; i < n; ++i) {
      if (i) printf(" ");
      printf("%d", a[i]);
    }
    puts("");
  } else
    puts("Incorrect sequence");
  return 0;
}
