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>
template <class T>
inline bool scan(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
using namespace std;
long long n, k;
long long a[100005];
vector<long long> b[100005];
long long get(string s) {
  long long ans = 0;
  long long sn = 1;
  long long l = 0;
  if (s[0] == '-') sn = -1, l++;
  for (; l < s.length(); l++) {
    ans = ans * 10 + s[l] - '0';
  }
  return ans * sn;
}
bool solve(vector<long long> &b, long long L, long long R, long long l,
           long long r) {
  if (R <= L) return 0;
  if (r < l) return 1;
  if (R - L - 1 < r - l + 1) return 0;
  long long len = r - l + 1;
  if (len / 2 < R && -((len - 1) / 2) > L) {
    for (long long i = r, j = len / 2; i >= l; i--, j--) {
      b[i] = j;
    }
  } else if ((len - 1) / 2 < R && -(len / 2) > L) {
    for (long long i = r, j = (len - 1) / 2; i >= l; i--, j--) {
      b[i] = j;
    }
  } else if (abs(L) < abs(R)) {
    for (long long i = l, j = L + 1; i <= r; i++, j++) {
      b[i] = j;
    }
  } else {
    for (long long i = r, j = R - 1; i >= l; i--, j--) {
      b[i] = j;
    }
  }
  return 1;
}
bool ok(vector<long long> &b) {
  long long sz = b.size();
  long long l = -2e9, r;
  long long pre = 0, now;
  for (long long i = 0; i < sz; i++) {
    if (b[i] != 1e9 + 5) {
      r = b[i];
      now = i;
      if (!solve(b, l, r, pre, now - 1)) return 0;
      pre = i + 1;
      l = b[i];
    }
  }
  if (!solve(b, l, 2e9, pre, sz - 1)) return 0;
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    string s;
    cin >> s;
    if (s[0] == '?')
      a[i] = 1e9 + 5;
    else
      a[i] = get(s);
  }
  for (long long i = 1; i <= k; i++) {
    b[i].clear();
    for (long long j = i; j <= n; j += k) b[i].push_back(a[j]);
  }
  for (long long i = 1; i <= k; i++) {
    if (!ok(b[i])) {
      cout << "Incorrect sequence" << endl;
      return 0;
    }
  }
  for (long long i = 1; i <= k; i++) {
    for (long long j = i, l = 0; j <= n; j += k, l++) {
      a[j] = b[i][l];
    }
  }
  for (long long i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
