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 N = 100100;
const int INF = -(int)2e9;
int a[N], mark[N];
char buf[20];
vector<int> dep[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, kk;
  cin >> n >> kk;
  memset(mark, 0, sizeof(mark));
  memset(a, 0, sizeof(a));
  for (int i = 0; i < (n); ++i) {
    cin >> buf;
    if (buf[0] == '?')
      mark[i] = true;
    else
      sscanf(buf, "%d", a + i);
  }
  for (int i = 0; i < (n); ++i) {
    dep[i % kk].push_back(i);
  }
  for (int i = 0; i < (kk); ++i)
    if (((int)dep[i].size()) > 1) {
      int lastFixed = INF;
      for (int j = 0; j < ((int)dep[i].size()); ++j) {
        if (!mark[dep[i][j]]) {
          if (a[dep[i][j]] <= lastFixed) {
            cout << "Incorrect sequence\n";
            return 0;
          }
          lastFixed = a[dep[i][j]];
          continue;
        }
        int k = j;
        while (k < ((int)dep[i].size()) and mark[dep[i][k]] > 0) ++k;
        assert(j < k);
        int len = (k - j);
        if (k == ((int)dep[i].size())) {
          if (lastFixed == INF) {
            for (int l = j; l < k; ++l) a[dep[i][l]] = -(len / 2) + (l - j);
          } else if (lastFixed >= 0) {
            for (int l = j; l < k; ++l) a[dep[i][l]] = lastFixed + l - j + 1;
          } else {
            int minv = max(-(len / 2), lastFixed + 1);
            for (int l = j; l < k; ++l) a[dep[i][l]] = minv + (l - j);
          }
        } else {
          if (lastFixed == INF) {
            if (a[dep[i][k]] <= 0) {
              for (int l = k - 1; l >= j; --l)
                a[dep[i][l]] = a[dep[i][k]] - (k - l);
            } else {
              int maxv = min((len / 2), a[dep[i][k]] - 1);
              for (int l = k - 1; l >= j; --l)
                a[dep[i][l]] = maxv - (k - l - 1);
            }
          } else {
            if ((long long)a[dep[i][k]] - (long long)lastFixed <= len) {
              cout << "Incorrect sequence\n";
              return 0;
            }
            if (a[dep[i][k]] < 0 and lastFixed < 0) {
              for (int l = k - 1; l >= j; --l)
                a[dep[i][l]] = a[dep[i][k]] - (k - l);
            } else if (a[dep[i][k]] >= 0 and lastFixed >= 0) {
              for (int l = j; l < k; ++l) a[dep[i][l]] = lastFixed + l - j + 1;
            } else {
              if (abs(a[dep[i][k]]) <= abs(lastFixed)) {
                int maxv = min((len / 2), a[dep[i][k]] - 1);
                for (int l = k - 1; l >= j; --l)
                  a[dep[i][l]] = maxv - (k - l - 1);
              } else {
                int minv = max(-(len / 2), lastFixed + 1);
                for (int l = j; l < k; ++l) a[dep[i][l]] = minv + (l - j);
              }
            }
          }
        }
        j = k - 1;
      }
    }
  for (int i = 0; i < (n); ++i) cout << a[i] << ' ';
  cout << '\n';
  return 0;
}
