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 int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 7;
const int M = 12;
long long n, k, a[N], l[N], r[N], sum;
char s[20];
bool flag[N];
vector<long long> v[N];
void solve(int o) {
  int len = strlen(s);
  if (s[0] == '?')
    a[o] = INF;
  else if (s[0] == '-') {
    long long ans = 0;
    for (int i = 1; i < len; i++) ans *= 10, ans += s[i] - '0';
    a[o] = -ans;
  } else {
    long long ans = 0;
    for (int i = 0; i < len; i++) ans *= 10, ans += s[i] - '0';
    a[o] = ans;
  }
}
bool cal() {
  for (int u = 0; u < k; u++) {
    v[u].push_back(INF - 1);
    int sz = v[u].size();
    if (!sz) continue;
    long long l = -INF, r = INF, cnt = 0;
    for (int i = 0; i < sz; i++) {
      if (v[u][i] != INF) {
        r = v[u][i] - 1;
        if (cnt > r - l + 1) return false;
        if (l >= 0) {
          int pos = i - cnt;
          for (int j = l; j < l + cnt; j++) v[u][pos++] = j;
        } else if (r <= 0) {
          int pos = i - 1;
          for (int j = r; j > r - cnt; j--) v[u][pos--] = j;
        } else {
          vector<long long> vec;
          long long num = cnt;
          if (num) vec.push_back(0 * 1ll), num--;
          long long L = -1, R = 1;
          while (num > 0) {
            if (L >= l && num > 0) vec.push_back(L), L--, num--;
            if (R <= r && num > 0) vec.push_back(R), R++, num--;
          }
          sort(vec.begin(), vec.end());
          int pos = i - cnt;
          for (int j = 0; j < vec.size(); j++) v[u][pos++] = vec[j];
        }
        cnt = 0;
        l = v[u][i] + 1;
        r = INF;
      } else
        cnt++;
    }
  }
  return true;
}
int main() {
  scanf("%lld", &n);
  scanf("%lld", &k);
  sum = 0;
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    solve(i);
    if (a[i] != INF) sum += abs(a[i]);
  }
  for (int i = 0; i < n; i++) v[i % k].push_back(a[i]);
  if (!cal())
    puts("Incorrect sequence");
  else {
    int ret = n;
    for (int j = 0; ret; j++)
      for (int i = 0; i < k && ret; i++) printf("%lld ", v[i][j]), ret--;
    puts("");
  }
  return 0;
}
