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 string problemName = "";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
const int INF = (1LL << 30) - 1;
const long long int LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int MOD = (int)(1e9) + 7;
const int NMAX = 200000 + 5;
const int MMAX = 100000 + 5;
const int KMAX = 100000 + 5;
const int PMAX = 100000 + 5;
const int LMAX = 100000 + 5;
const int VMAX = 100000 + 5;
int N, K;
int A[NMAX];
int viz[NMAX];
void citeste_linia() {
  int i, j, p, sign, num_start;
  char c;
  char line[11 * NMAX];
  int line_len;
  gets(line);
  line_len = strlen(line);
  line[line_len] = '\n';
  for (i = j = 0; i <= line_len; i++) {
    c = line[i];
    if (c == '?') {
      viz[++j] = 1;
      num_start = 0;
    } else if (c == '-' || ('0' <= c && c <= '9')) {
      if (!num_start && c != '-') {
        sign = 1;
        num_start = 1;
        p = c - '0';
      } else if (!num_start && c == '-') {
        sign = -1;
        num_start = 1;
        p = 0;
      } else {
        p = p * 10 + c - '0';
      }
    } else if (num_start) {
      num_start = 0;
      A[++j] = p * sign;
      sign = p = 0;
    }
  }
}
int main() {
  int i, j, k, p, first, last;
  vector<int> V;
  scanf("%d %d\n", &N, &K);
  citeste_linia();
  for (p = 1; p <= K; p++) {
    first = -INF;
    for (i = p; i <= N + K; i += K)
      if (viz[i])
        V.push_back(i);
      else {
        last = (i > N) ? INF : A[i];
        if (last <= first) {
          printf("Incorrect sequence\n");
          return 0;
        }
        if (!V.empty()) {
          if ((last - first - 1) < (int)(V.size())) {
            printf("Incorrect sequence\n");
            return 0;
          }
          if (first >= 0) {
            for (j = 0; j < V.size(); j++) A[V[j]] = first + j + 1;
            V.resize(0);
          } else if (last <= 0) {
            for (j = V.size() - 1; j >= 0; j--) A[V[j]] = last - (V.size() - j);
            V.resize(0);
          } else {
            for (j = 0; j < V.size(); j++)
              A[V[j]] = j - ((int)V.size() - 1) / 2;
            while (A[V.back()] >= last || A[V[0]] <= first) {
              if (A[V.back()] >= last) k = A[V.back()] - last + 1;
              for (j = 0; j < V.size(); j++) A[V[j]] -= k;
              if (A[V[0]] <= first) k = -(first - A[V[0]] + 1);
            }
            V.resize(0);
          }
        }
        first = last;
      }
  }
  for (i = 1; i <= N; i++) printf("%d ", A[i]);
  return 0;
}
