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 = 1000 * 100 + 5, inf = 1000000000000000LL;
long long a[N];
vector<long long> r[N];
set<long long>::iterator it;
int main() {
  long long n, k, i, x;
  cin >> n >> k;
  scanf("\n");
  char ch;
  for (i = 1; i <= n; i++) {
    scanf("%c", &ch);
    if (ch == ' ') {
      scanf("%c", &ch);
    }
    if (ch == '?') {
      x = -inf;
    } else {
      long long fl = 1;
      if (ch == '-') {
        fl = -1;
        ch = getchar();
      }
      x = ch - '0';
      while (1) {
        ch = getchar();
        if (!isdigit(ch)) {
          break;
        }
        x = x * 10 + ch - '0';
      }
      x = x * fl;
    }
    a[i] = x;
    r[i % k].push_back(x);
  }
  long long left, right;
  for (i = 0; i < k; i++) {
    left = -1;
    long long lb, rb;
    if ((int(r[i].size())) == 0) {
      continue;
    }
    while (left < (int(r[i].size()))) {
      right = left + 1;
      while ((right < (int(r[i].size()))) && (r[i][right] == -inf)) {
        right++;
      }
      set<long long> s;
      if (left == -1) {
        lb = -inf * 2;
      } else {
        lb = r[i][left];
      }
      if (right == (int(r[i].size()))) {
        rb = inf * 2;
      } else {
        rb = r[i][right];
      }
      if (rb - 0LL - lb - 1 < right - left - 1) {
        puts("Incorrect sequence");
        return 0;
      }
      long long cnt = right - left - 1, curr = 0;
      if (cnt == 0) {
        left = right;
        continue;
      }
      lb++;
      rb--;
      if ((lb <= 0) && (rb >= 0)) {
        s.insert(0);
        cnt--;
        long long fl = 1;
        curr = 1;
        if (rb == 0) {
          curr = -1;
          fl = 0;
        }
        while (cnt > 0) {
          s.insert(curr);
          if (fl) {
            if (-curr < lb) {
              curr++;
            } else {
              curr = -curr;
              fl = 0;
            }
          } else {
            if (-(curr - 1) > rb) {
              curr--;
            } else {
              curr = -(curr - 1);
              fl = 1;
            }
          }
          cnt--;
        }
      } else if (lb > 0) {
        while (cnt > 0) {
          s.insert(lb);
          lb++;
          cnt--;
        }
      } else {
        while (cnt > 0) {
          s.insert(rb);
          rb--;
          cnt--;
        }
      }
      it = s.begin();
      for (left = left + 1; left < right; left++) {
        r[i][left] = (*it);
        it++;
      }
    }
  }
  for (i = n; i >= 1; i--) {
    a[i] = r[i % k].back();
    r[i % k].pop_back();
  }
  for (i = 1; i <= n; i++) {
    printf("%I64d ", a[i]);
  }
  return 0;
}
