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;
int n, A[100005], K;
const int inf = (int)1e9 + 300005 + 7;
bool gao(vector<int> &p) {
  int m = (int)(p).size();
  vector<int> pp = p;
  for (int i = 0; i < m;) {
    if (p[i] != inf)
      ++i;
    else {
      int j = i;
      for (; j < m && p[j] == inf; ++j)
        ;
      int l = -inf, r = inf;
      if (i > 0) l = p[i - 1] + 1;
      if (j < m) r = p[j] - 1;
      if (j - i > r - l + 1) return 0;
      if (r <= 0) {
        for (int k = (int)(j - 1); k >= (int)(i); --k) p[k] = r--;
      } else if (l >= 0) {
        for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = l++;
      } else {
        int len = j - i;
        if (len & 1) {
          int a = len / 2;
          if (abs(l) >= a && abs(r) >= a) {
            a = -a;
            for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = a++;
          } else if (abs(l) < a) {
            for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = l++;
          } else if (abs(r) < a) {
            for (int k = (int)(j - 1); k >= (int)(i); --k) p[k] = r--;
          } else {
            assert(0);
          }
        } else {
          int a = len / 2 - 1, b = len / 2 - 1;
          a = -a;
          if (abs(l) >= abs(r))
            --a;
          else
            ++b;
          if (abs(l) >= abs(a) && abs(r) >= b) {
            for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = a++;
          } else if (abs(l) < abs(a)) {
            for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = l++;
          } else if (abs(r) < b) {
            for (int k = (int)(j - 1); k >= (int)(i); --k) p[k] = r--;
          } else {
            assert(0);
          }
        }
      }
      i = j;
    }
  }
  for (int i = 0; i < m - 1; ++i) {
    if (p[i] >= p[i + 1]) {
      return 0;
    }
  }
  return 1;
}
int main() {
  scanf("%d%d", &n, &K);
  for (int i = 0; i < (int)(n); ++i) {
    static char ss[100];
    scanf("%s", ss);
    if (ss[0] == '?')
      A[i] = inf;
    else
      A[i] = atoi(ss);
  }
  vector<int> p;
  for (int i = 0; i < K; ++i) {
    p.clear();
    for (int j = i; j < n; j += K) p.push_back(A[j]);
    if (!gao(p)) return puts("Incorrect sequence") & 0;
    for (int j = i, k = 0; j < n; j += K) A[j] = p[k++];
  }
  int s = 0;
  for (int i = 0; i < (int)(n); ++i) printf("%d ", A[i]), s += abs(A[i]);
  puts("");
  return 0;
}
