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 S, typename T>
ostream& operator<<(ostream& out, pair<S, T> const& p) {
  out << '(' << p.first << ", " << p.second << ')';
  return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> const& v) {
  long long l = v.size();
  for (long long i = 0; i < l - 1; i++) out << v[i] << ' ';
  if (l > 0) out << v[l - 1];
  return out;
}
template <typename T>
void trace(const char* name, T&& arg1) {
  cout << name << " : " << arg1 << "\n";
}
template <typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  trace(comma + 1, args...);
}
long long n, k;
vector<long long> v;
vector<bool> check;
void solve(long long beg, long long end, long long i) {
  if (beg == i or end + k > n) {
    long long left = INT_MIN, right = INT_MAX;
    long long cnt = (end - beg) / k + 1;
    if (beg != i) left = v[beg - k];
    if (end + k <= n) right = v[end + k];
    if (left >= 0) {
      long long val = left + 1;
      for (long long p = beg; p <= end; p += k) v[p] = val++;
      return;
    } else if (right <= 0) {
      long long val = right - 1;
      for (long long p = end; p >= beg; p -= k) v[p] = val--;
      return;
    }
    set<long long> val;
    val.insert(0);
    long long x = 1, done = 1;
    while (done < cnt) {
      if (-1 * x > left) {
        val.insert(-1 * x);
        done++;
      }
      if (done == cnt) break;
      if (x < right) {
        val.insert(x);
        done++;
      }
      x++;
    }
    for (long long p = beg; p <= end; p += k) {
      v[p] = (*val.begin());
      val.erase(*val.begin());
    }
  } else {
    long long cnt = (end - beg) / k + 1;
    if (v[end + k] - v[beg - k] - 1 < cnt) {
      cout << "Incorrect sequence\n";
      exit(0);
    }
    if (v[beg - k] >= 0) {
      long long val = v[beg - k] + 1;
      for (long long p = beg; p <= end; p += k) v[p] = val++;
    } else if (v[beg - k] <= 0 and v[end + k] <= 0) {
      long long val = v[end + k] - 1;
      for (long long p = end; p >= beg; p -= k) v[p] = val--;
    } else {
      long long left = v[beg - k], right = v[end + k];
      set<long long> val;
      val.insert(0);
      long long x = 1, done = 1;
      while (done < cnt) {
        if (-1 * x > left) {
          val.insert(-1 * x);
          done++;
        }
        if (done == cnt) break;
        if (x < right) {
          val.insert(x);
          done++;
        }
        x++;
      }
      for (long long p = beg; p <= end; p += k) {
        v[p] = (*val.begin());
        val.erase(*val.begin());
      }
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  v.resize(n + 1, 0);
  check.resize(n + 1, false);
  for (long long i = 1; i <= n; i++) {
    string x;
    cin >> x;
    if (x == "?")
      check[i] = true;
    else {
      long long num = 0;
      for (long long j = 0; x[j] != '\0'; j++) {
        if (x[j] == '-') continue;
        num = num * 10 + (x[j] - '0');
      }
      if (x[0] == '-') num = -num;
      v[i] = num;
    }
  }
  for (long long i = 1; i <= k; i++) {
    long long f = -1, l = -1;
    long long mn = INT_MIN;
    long long j;
    for (j = i; j <= n; j += k) {
      if (check[j] == true and f == -1)
        f = j;
      else if (check[j] != true and f != -1) {
        l = j - k;
        solve(f, l, i);
        f = -1;
        l = -1;
      } else if (check[j] != true and v[j] <= mn) {
        cout << "Incorrect sequence\n";
        return 0;
      }
      if (check[j] == false) mn = v[j];
    }
    if (f != -1) solve(f, j - k, i);
  }
  for (long long i = 1; i <= n; i++) cout << v[i] << " ";
  cout << "\n";
  return 0;
}
