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 N = 1e5 + 5;
int a[N];
bool isQuestion[N];
char t[N];
int get(char *s) {
  if (s[0] == '-') {
    return -get(s + 1);
  }
  int ret = 0;
  for (int i = 0; s[i] != 0; ++i) {
    ret = ret * 10 + s[i] - '0';
  }
  return ret;
}
pair<long long, int> getValue(int st, int k) {
  long long ret = 0;
  for (int i = st; i <= st + k - 1; ++i) ret += abs(i);
  return {ret, st};
}
int getSt(int st, int ed, int k) {
  pair<long long, int> ret = min(getValue(st, k), getValue(ed - k + 1, k));
  if (st < 0 && ed > 0) {
    ret = min(ret, getValue(max(st, min(-k / 2, ed - k + 1)), k));
  }
  return ret.second;
}
void solve2() {
  int n, k;
  scanf("%d %d ", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%s ", t);
    if (t[0] == '?') {
      isQuestion[i] = true;
    } else {
      isQuestion[i] = false;
      a[i] = get(t);
    }
  }
  a[0] = -2e9;
  a[n + 1] = 2e9;
  for (int i = 1; i <= k; ++i) {
    vector<int> v;
    v.push_back(0);
    for (int j = i; j <= n; j += k) {
      v.push_back(j);
    }
    v.push_back(n + 1);
    int maxi = -2e9 - 19;
    for (int ind : v) {
      if (!isQuestion[ind]) {
        if (maxi >= a[ind]) {
          printf("Incorrect sequence\n");
          return;
        }
        maxi = a[ind];
      }
    }
    for (int j = 0; j + 1 < v.size();) {
      int ind = v[j];
      if (isQuestion[ind]) {
        ++j;
        continue;
      }
      int t;
      for (t = j + 1; t < v.size(); ++t) {
        if (!isQuestion[v[t]]) {
          break;
        }
      }
      if (t < v.size() && (long long)a[v[t]] - a[v[j]] < t - j) {
        printf("Incorrect sequence\n");
        return;
      }
      if (t - j - 1 > 0) {
        int st = getSt(a[v[j]] + 1, a[v[t]] - 1, t - j - 1);
        for (int x = j + 1; x < t; ++x) {
          a[v[x]] = st + x - j - 1;
        }
      }
      j = t;
    }
  }
  for (int i = 1; i <= n; ++i) {
    printf("%d ", a[i]);
  }
  putchar('\n');
}
void solve() { solve2(); }
int main() {
  solve();
  return 0;
}
