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;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const int mod = 2000000007;
const int inf = 50000000;
const int maxn = 100010;
int n, k, A[maxn], notSet[maxn];
vector<int> v[maxn], temp;
string str;
int push(int l, int r, int sz) {
  if (1LL * r - l - 1 < sz) {
    return 0;
  }
  temp.clear();
  if (l < 0 && r <= 0) {
    for (int i = 0; i < sz; i++) {
      temp.push_back(r - i - 1);
    }
    reverse(temp.begin(), temp.end());
  } else if (l >= 0 && r > 0) {
    for (int i = 0; i < sz; i++) {
      temp.push_back(l + i + 1);
    }
  } else {
    int c = 0;
    long long sum = 1LL << 50;
    for (int i = 0; i < sz; i++) {
      if (-l - 1 < i) {
        break;
      }
      if (r - 1 < sz - i - 1) {
        continue;
      }
      long long second =
          (1LL * (i - 1) * i) / 2 + (1LL * (sz - i - 1) * (sz - i)) / 2;
      if (second < sum) {
        sum = second;
        c = -i;
      }
    }
    for (int i = 0; i < sz; i++) {
      temp.push_back(c);
      c += 1;
    }
  }
  return 1;
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    cin >> str;
    if (str[0] == '?') {
      notSet[i] = 1;
      A[i] = mod;
    } else {
      A[i] = stoi(str);
    }
    v[i % k].push_back(A[i]);
  }
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < v[i].size();) {
      if (v[i][j] == mod) {
        int p = j;
        while (p < v[i].size()) {
          if (v[i][p] != mod) {
            break;
          }
          p += 1;
        }
        int lft = (j == 0) ? -mod : v[i][j - 1];
        int rgt = (p == v[i].size()) ? mod : v[i][p];
        if (!push(lft, rgt, p - j)) {
          printf("Incorrect sequence\n");
          return 0;
        } else {
          int c = 0;
          while (j < p) {
            A[j * k + i] = v[i][j] = temp[c];
            j += 1;
            c += 1;
          }
        }
      } else {
        if (j > 0 && v[i][j] <= v[i][j - 1]) {
          printf("Incorrect sequence\n");
          return 0;
        }
        j += 1;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", A[i]);
  }
  printf("\n");
  return 0;
}
