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;
vector<int> grp[100002];
int main() {
  int n, k, i, j, a[100002], flag = 0;
  scanf("%d%d", &n, &k);
  ;
  for (i = 0; i < n; i++) {
    string s;
    cin >> s;
    if (s[0] == '?')
      a[i] = INT_MIN;
    else {
      int sign = 1, l = s.size();
      a[i] = 0, j = 0;
      if (s[0] == '-') {
        sign = -1;
        j = 1;
      }
      for (; j < s.size(); j++) a[i] = a[i] * 10 + (s[j] - '0');
      a[i] *= sign;
    }
    grp[i % k].push_back(a[i]);
  }
  for (i = 0; i < k; i++) {
    int l = grp[i].size(), val, cur = INT_MIN, pos = 0, prev = -1;
    if (l == 0) {
      if (grp[i][0] == INT_MIN) grp[i][0] = 0;
      continue;
    }
    while (pos < l) {
      if (grp[i][pos] != INT_MIN) {
        int ele = pos - prev - 1, cnt;
        if (cur >= 0)
          cnt = cur + 1;
        else if (grp[i][pos] < 0)
          cnt = grp[i][pos] - ele;
        else
          cnt = min(max(0 - ele / 2, cur + 1), grp[i][pos] - ele);
        for (j = prev + 1; j < pos; j++) grp[i][j] = cnt++;
        cur = grp[i][pos];
        prev = pos;
      }
      pos++;
    }
    int ele = l - 1 - prev, cnt = max(cur + 1, 0 - ele / 2);
    for (j = prev + 1; j < l; j++) grp[i][j] = cnt++;
    for (j = 0; j < l - 1; j++)
      if (grp[i][j] >= grp[i][j + 1]) flag = 1;
  }
  if (flag)
    cout << "Incorrect sequence\n";
  else {
    int cnt = 0, j = 0;
    while (cnt < n) {
      printf("%d ", grp[cnt % k][j]);
      cnt++;
      if (cnt % k == 0) j++;
    }
    cout << endl;
  }
  return 0;
}
