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 q = -1000000002;
int n, k;
int solve(vector<int> &v) {
  int prev = 0;
  for (int ii = 1; ii < v.size(); ii++) {
    if (v[ii] == q) continue;
    if (ii - prev > v[ii] - v[prev]) return 0;
    if (v[prev] >= 0) {
      for (int jj = 1; jj < ii - prev; jj++) {
        v[prev + jj] = v[prev] + jj;
      }
    } else if (v[ii] <= 0) {
      for (int jj = 1; ii - jj > prev; jj++) {
        v[ii - jj] = v[ii] - jj;
      }
    } else {
      int d = (ii - prev - 1) / 2 + (ii - prev - 1) % 2;
      if (v[ii] <= d) {
        for (int jj = 1; ii - jj > prev; jj++) {
          v[ii - jj] = v[ii] - jj;
        }
      } else if (v[prev] >= -d) {
        for (int jj = 1; jj < ii - prev; jj++) {
          v[prev + jj] = v[prev] + jj;
        }
      } else {
        for (int jj = 1; jj < ii - prev; jj++) {
          v[prev + jj] = -d + jj;
        }
      }
    }
    prev = ii;
  }
  return 1;
}
int main() {
  int seq[100007];
  vector<int> vs[100007];
  cin >> n >> k;
  for (int ii = 0; ii < n; ii++) {
    string s;
    cin >> s;
    if (s == "?") {
      seq[ii] = q;
    } else {
      seq[ii] = atoi(s.c_str());
    }
  }
  for (int ii = 0; ii < k; ii++) {
    vs[ii].push_back(q + 1);
    for (int jj = 0; ii + jj * k < n; jj++) {
      vs[ii].push_back(seq[ii + jj * k]);
    }
    vs[ii].push_back(-(q + 1));
    if (solve(vs[ii]) == 0) {
      cout << "Incorrect sequence" << endl;
      return 0;
    }
  }
  int ii = 1;
  while (true) {
    int printed = 0;
    for (int jj = 0; jj < k; jj++) {
      if (ii < vs[jj].size() - 1) {
        cout << vs[jj][ii] << " ";
        printed = 1;
      }
    }
    ii++;
    if (!printed) break;
  }
  cout << endl;
}
