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 long long N = 1e5 + 5, mod = 1e9 + 7, bit = 61;
vector<long long long long> adj[N];
void bye() {
  cout << "Incorrect sequence\n";
  exit(0);
}
long long long long get(long long long long x) { return x * (x + 1) >> 1; }
bool solve(vector<long long long long> &v) {
  long long long long n = (long long)v.size();
  long long long long prev = -2147483647;
  for (long long long long i = -1; i <= n - 1; i++) {
    long long long long j = i + 1;
    while (j < n and v[j] == 2147483647) {
      j++;
    }
    long long long long curr;
    if (j == n) {
      curr = 2147483647;
    } else {
      curr = v[j];
    }
    if (i + 1 >= n) {
      return 1;
    }
    if (curr - prev < j - i) {
      return 0;
    }
    if (prev <= 0 and curr <= 0) {
      long long long long e = curr - 1;
      for (long long long long x = j - 1; x >= i + 1; x--) {
        v[x] = e--;
        if (v[x] <= prev) {
          return 0;
        }
      }
    } else if (prev >= 0 and curr >= 0) {
      long long long long e = prev + 1;
      for (long long long long x = i + 1; x <= j - 1; x++) {
        v[x] = e++;
        if (v[x] >= curr) {
          return 0;
        }
      }
    } else {
      if (i + 1 > j - 1) {
        prev = curr;
        i = j - 1;
        continue;
      }
      long long long long id = -1;
      long long long long best = 9223372036854775807;
      long long long long mn = 0;
      long long long long mx = (j - 1 - i - 1);
      for (long long long long x = i + 1; x <= j - 1; x++) {
        if (mn <= prev or mx >= curr) {
          continue;
        }
        long long long long sum = get(abs(mn)) + get(abs(mx));
        if (sum < best) {
          best = sum;
          id = x;
        }
        mx--;
        mn--;
      }
      if (id == -1) {
        return 0;
      }
      long long long long nw = 0;
      v[id] = 0;
      for (long long long long x = id - 1; x >= i + 1; x--) {
        v[x] = --nw;
      }
      nw = 0;
      for (long long long long x = id + 1; x <= j - 1; x++) {
        v[x] = ++nw;
      }
    }
    prev = curr;
    i = j - 1;
  }
  return 1;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long long long t = 1;
  while (t--) {
    long long long long n, k;
    cin >> n >> k;
    for (long long long long i = 0; i <= n - 1; i++) {
      long long long long x;
      string s;
      cin >> s;
      if (s == "?") {
        x = 2147483647;
      } else {
        x = stol(s);
      }
      adj[i % k].push_back(x);
    }
    for (long long long long i = 0; i <= k - 1; i++) {
      if (!solve(adj[i])) {
        bye();
      }
    }
    for (long long long long i = 0; i <= n - 1; i++) {
      cout << adj[i % k][i / k] << ' ';
    }
    cout << '\n';
  }
  return 0;
}
