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 MAXN = 1e5 + 10;
const long long INF = 0x3f3f3f3f3f3f3f3f;
int n, k;
struct Number {
  int value;
  bool unknown;
  friend istream& operator>>(istream& in, Number& num) {
    string s;
    in >> s;
    if (s[0] == '?') {
      num.unknown = true;
    } else {
      num.unknown = false;
      stringstream ss(s);
      ss >> num.value;
    }
    return in;
  }
  friend ostream& operator<<(ostream& out, Number& num) {
    out << num.value;
    return out;
  }
} num[MAXN];
bool tryFill(int left, int right) {
  long long lower = -INF, upper = INF;
  if (left - k >= 0) {
    lower = num[left - k].value;
  }
  if (right + k < n) {
    upper = num[right + k].value;
  }
  int cnt = (right - left) / k + 1;
  if (upper - lower - 1 < cnt) {
    return false;
  }
  set<int> numSet;
  if (lower <= 0 && upper >= 0) {
    if (lower != 0 && upper != 0) {
      numSet.insert(0);
    }
    int index = 1;
    while ((int)numSet.size() < cnt) {
      if (index < -lower) {
        numSet.insert(-index);
      }
      if (index < upper) {
        numSet.insert(index);
      }
      ++index;
    }
  } else if (upper < 0) {
    while ((int)numSet.size() < cnt) {
      numSet.insert(--upper);
    }
  } else {
    while ((int)numSet.size() < cnt) {
      numSet.insert(++lower);
    }
  }
  auto it = numSet.begin();
  for (int i = left; i <= right; i += k) {
    num[i].value = *(it++);
  }
  return true;
}
int main() {
  while (cin >> n >> k) {
    for (int i = 0; i < n; ++i) {
      cin >> num[i];
    }
    bool valid = true;
    for (int i = 0, j; i < k && valid; ++i) {
      int left = -1, right;
      for (j = i; j < n && valid; j += k) {
        if (num[j].unknown && left == -1) {
          left = j;
        }
        if (left != -1 && !num[j].unknown) {
          right = j - k;
          if (!tryFill(left, right)) {
            valid = false;
          }
          left = -1;
        }
      }
      if (left != -1) {
        right = j - k;
        if (!tryFill(left, right)) {
          valid = false;
        }
      }
    }
    for (int i = 0; i < n - k; ++i) {
      if (num[i].value >= num[i + k].value) {
        valid = false;
        break;
      }
    }
    if (!valid) {
      cout << "Incorrect sequence" << endl;
    } else {
      for (int i = 0; i < n; ++i) {
        if (i) {
          cout << ' ';
        }
        cout << num[i];
      }
      cout << endl;
    }
  }
  return 0;
}
