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 = (int)2e9 + 7;
const char noAns[] = "Incorrect sequence";
int n, m;
int a[100100];
int readInt(void) {
  char s[22];
  scanf("%s", s);
  if (s[0] == '?') return (INF);
  int val = 0;
  if (s[0] == '-') {
    for (int i = (1), _b = (strlen(s) - 1); i <= _b; i = i + 1)
      val = val * 10 + s[i] - '0';
    return (-val);
  } else {
    for (int i = 0, _n = (strlen(s)); i < _n; i = i + 1)
      val = val * 10 + s[i] - '0';
    return (val);
  }
}
void init(void) {
  n = readInt();
  m = readInt();
  for (int i = 0, _n = (n); i < _n; i = i + 1) a[i] = readInt();
}
void noAnswer(void) {
  printf("%s\n", noAns);
  exit(0);
}
void fillSeq(vector<int> &v, int l, int r) {
  int minVal = l == 0 ? -INF : v[l - 1] + 1;
  int maxVal = r == (int)v.size() - 1 ? INF : v[r + 1] - 1;
  if (r - l + 1 > 1LL + maxVal - minVal) noAnswer();
  if (minVal >= 0) {
    for (int i = (l), _b = (r); i <= _b; i = i + 1) v[i] = minVal++;
  } else if (maxVal <= 0) {
    for (int i = (r), _a = (l); i >= _a; i = i - 1) v[i] = maxVal--;
  } else {
    int pos = 0;
    int neg = -1;
    for (int i = (l), _b = (r); i <= _b; i = i + 1) {
      if (pos > maxVal)
        v[i] = neg--;
      else if (neg < minVal)
        v[i] = pos++;
      else if (-neg < pos)
        v[i] = neg--;
      else
        v[i] = pos++;
    }
    sort(v.begin() + l, v.begin() + r + 1);
  }
}
void process(void) {
  for (int i = 0, _n = (m); i < _n; i = i + 1) {
    vector<int> v, fst, lst;
    for (int j = i; j < n; j = j + m) v.push_back(a[j]);
    for (int j = 0, _n = (v.size()); j < _n; j = j + 1)
      if (v[j] >= INF) {
        if (j == 0 || v[j - 1] < INF) fst.push_back(j);
        if (j == (int)v.size() - 1 || v[j + 1] < INF) lst.push_back(j);
      }
    for (int j = 0, _n = (fst.size()); j < _n; j = j + 1)
      fillSeq(v, fst[j], lst[j]);
    int id = 0;
    for (int j = i; j < n; j = j + m) a[j] = v[id++];
  }
  for (int i = 0, _n = (n); i < _n; i = i + 1)
    if (i + m < n && a[i] >= a[i + m]) noAnswer();
  for (int i = 0, _n = (n); i < _n; i = i + 1) printf("%d ", a[i]);
  printf("\n");
}
int main(void) {
  init();
  process();
  return 0;
}
