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 MAX = 1e5 + 5;
const long long SEN = 1LL << 60;
vector<long long> chains[MAX];
int main() {
  long long N, K;
  scanf("%lld %lld%*c", &N, &K);
  for (long long i = long long(0); i < long long(K); i++) {
    chains[i].push_back(-(1LL << 59));
  }
  for (long long i = long long(0); i < long long(N); i++) {
    char buf[15];
    scanf("%s%*c", buf);
    if (buf[0] == '?') {
      chains[i % K].push_back(SEN);
    } else {
      chains[i % K].push_back(atoi(buf));
    }
  }
  for (long long i = long long(0); i < long long(K); i++) {
    chains[i].push_back((1LL << 59));
  }
  bool deu_ruim = false;
  for (long long i = long long(0); i < long long(K); i++) {
    if (chains[i].size() == 1) {
      if (chains[i][0] == SEN) {
        chains[i][0] = 0;
      }
      continue;
    }
    long long left = 0, right = -1;
    for (long long j = long long(1); j < long long(chains[i].size()); j++) {
      if (chains[i][j] != SEN) {
        if (left != -1) {
          right = j;
        } else {
          left = j;
        }
      }
      if (left != -1 && right != -1) {
        if (chains[i][left] < 0 && chains[i][right] <= 0) {
          long long cur = chains[i][right] - 1;
          for (long long k = long long(right - 1); k >= long long(left + 1);
               k--) {
            chains[i][k] = cur--;
          }
        } else if (chains[i][left] >= 0 && chains[i][right] > 0) {
          long long cur = chains[i][left] + 1;
          for (long long k = long long(left + 1); k < long long(right); k++) {
            chains[i][k] = cur++;
          }
        } else {
          long long avail = chains[i][right] - chains[i][left] - 1;
          long long sz = right - left - 1;
          if (sz > avail) {
            deu_ruim = true;
            break;
          }
          long long start = -(sz / 2);
          if (chains[i][left] >= start) {
            start = chains[i][left] + 1;
          }
          for (long long k = long long(left + 1); k < long long(right); k++) {
            chains[i][k] = start++;
          }
        }
        left = right;
        right = -1;
      }
    }
  }
  if (deu_ruim) {
    puts("Incorrect sequence");
  } else {
    vector<long long> new_arr;
    bool rua_nois = true;
    for (long long i = long long(0); i < long long(K); i++) {
      for (long long j = long long(2); j < long long(chains[i].size() - 1);
           j++) {
        if (chains[i][j] <= chains[i][j - 1]) {
          rua_nois = false;
          break;
        }
      }
      if (!rua_nois) {
        break;
      }
    }
    if (rua_nois) {
      int k = 1;
      while (N) {
        for (long long i = long long(0); i < long long(K); i++) {
          printf("%lld ", chains[i][k]);
          N--;
          if (!N) {
            break;
          }
        }
        k++;
      }
      printf("\n");
    } else {
      puts("Incorrect sequence");
    }
  }
  return 0;
}
