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<long long> v[2][100005];
int a[100005], cnt[100005];
int main() {
  int n, k, i, j, x, bg;
  while (cin >> n >> k) {
    string s;
    for (i = 0; i < n; i++) {
      v[0][i].push_back(-1100000000LL);
      v[1][i].push_back(0);
    }
    for (i = 0; i < n; i++) {
      cin >> s;
      if (s == "?")
        v[1][i % k][v[1][i % k].size() - 1]++;
      else {
        a[i] = atoi(s.c_str());
        v[0][i % k].push_back((long long)a[i]);
        v[1][i % k].push_back(0);
      }
    }
    for (i = 0; i < n; i++) v[0][i].push_back(1100000000LL);
    int f = 0;
    for (i = 0; i < k; i++) {
      int tmp = 0;
      for (j = 0; j < v[0][i].size() - 1; j++) {
        if (v[0][i][j + 1] - v[0][i][j] - 1 < v[1][i][j]) {
          f = 1;
          break;
        }
        tmp++;
        if (v[0][i][j] >= 0)
          bg = v[0][i][j] + 1;
        else if (v[0][i][j + 1] <= 0)
          bg = v[0][i][j + 1] - v[1][i][j];
        else {
          if (2 * min(abs(v[0][i][j]), abs(v[0][i][j + 1])) - 1 >= v[1][i][j])
            bg = -(v[1][i][j] - 1) / 2;
          else if (abs(v[0][i][j]) < abs(v[0][i][j + 1]))
            bg = v[0][i][j] + 1;
          else
            bg = v[0][i][j + 1] - v[1][i][j];
        }
        for (x = tmp; x < tmp + v[1][i][j]; x++) {
          a[i + (x - 1) * k] = bg++;
        }
        tmp += v[1][i][j];
      }
    }
    if (f)
      cout << "Incorrect sequence" << endl;
    else {
      for (i = 0; i < n; i++) {
        cout << a[i];
        if (i < n - 1)
          cout << " ";
        else
          cout << endl;
      }
    }
  }
  return 0;
}
