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;
int total, k, number[100005], cur[100005], end1 = 1, all;
bool test[100005] = {0}, t_cur[100005] = {0}, ans = 1;
string s;
void con(int _max, int _min, int quote, int begin) {
  if (quote & 1)
    if (_max - 1 < quote - 1 >> 1) {
      int c = 1;
      for (int i = begin + quote - 1; i >= begin; i--) {
        cur[i] = _max - c;
        c++;
      }
    } else if (-_min - 1 < quote - 1 >> 1) {
      int c = 1;
      for (int i = begin; i < begin + quote; i++) {
        cur[i] = _min + c;
        c++;
      }
    } else {
      int u;
      u = quote - 1 >> 1;
      for (int i = begin + quote - 1; i >= begin; i--) cur[i] = u--;
    }
  else {
    if (_max - 1 <= quote - 1 >> 1) {
      int c = 1;
      for (int i = begin + quote - 1; i >= begin; i--) {
        cur[i] = _max - c;
        c++;
      }
    } else if (-_min - 1 <= quote - 1 >> 1) {
      int c = 1;
      for (int i = begin; i < begin + quote; i++) {
        cur[i] = _min + c;
        c++;
      }
    } else {
      int u;
      u = quote - 1 >> 1;
      for (int i = begin + quote - 1; i >= begin; i--) cur[i] = u--;
    }
  }
}
void construct() {
  int _min = -1000000002, _max = 1000000001, quote = 0, begin;
  bool flag = 1;
  if (t_cur[1]) {
    begin = 1;
    quote++;
  } else {
    begin = 2;
    _min = cur[1];
  }
  for (int i = 2; i < end1;) {
    if (t_cur[i]) {
      quote++;
      i++;
    } else {
      _max = cur[i];
      if (_max - _min - 1 < quote) {
        ans = 0;
        return;
      }
      if (_min >= -1) {
        for (int m = begin; m < begin + quote; m++) cur[m] = ++_min;
      } else if (_max <= 1) {
        for (int m = begin + quote - 1; m >= begin; m--) cur[m] = --_max;
      } else if (quote > 0)
        con(_max, _min, quote, begin);
      _min = cur[i];
      i = begin + quote + 1;
      begin = i;
      quote = 0;
    }
  }
  if (t_cur[end1 - 1]) {
    con(1000000002, _min, quote, begin);
  }
}
int main() {
  cin >> total >> k;
  for (int i = 1; i <= total; i++) {
    cin >> s;
    if (s[0] == '?')
      test[i] = 1;
    else {
      int res = 0, y = 0;
      if (s[0] == '-') y = 1;
      for (int m = y; m < s.size(); m++) {
        res *= 10;
        res += s[m] - '0';
      }
      if (s[0] == '-')
        number[i] = -res;
      else
        number[i] = res;
    }
  }
  all = k;
  while (k-- && ans) {
    memset(t_cur, 0, end1 + 1);
    end1 = 1;
    for (int i = k + 1; i <= total; i += all)
      if (!test[i])
        cur[end1++] = number[i];
      else
        t_cur[end1++] = 1;
    construct();
    for (int i = k + 1, n = 1; i <= total; i += all) number[i] = cur[n++];
  }
  if (ans) {
    for (int i = 1; i <= total; i++) cout << number[i] << ' ';
  } else {
    cout << "Incorrect sequence";
  }
  return 0;
}
