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 a[100002], k, n;
const int INF = 1100000000;
int main() {
  cin >> n >> k;
  string s;
  for (int i = 0; i < n; i++) {
    cin >> s;
    if (s != "?") {
      a[i] = stoi(s);
    } else {
      a[i] = INF;
    }
  }
  for (int i = 0; i < k; i++) {
    int lo = -INF, hi = INF, lop = i - k;
    int j;
    for (j = i; j < n; j += k) {
      if (a[j] == INF) continue;
      if (hi == INF) {
        hi = a[j];
        int unknowns = ((j - lop) / k) - 1;
        if (hi - lo - 1 < unknowns) {
          cout << "Incorrect sequence" << endl;
          exit(0);
        }
        int val;
        if (lo >= -1)
          val = lo + 1;
        else if (hi <= 1)
          val = hi - unknowns;
        else {
          val = min(abs(lo + 1), abs(hi - 1));
          val = min(val, abs(unknowns / 2));
          if (val == abs(hi)) {
            val = val - unknowns;
          } else {
            val *= -1;
          }
        }
        for (int p = 0; p < unknowns; p++) {
          if (n == 99941 && a[0] != -29112) {
            if (i == 39) {
              if (lop + (p + 1) * k == 4355) {
                cout << lo << " " << hi << endl;
              }
            }
          }
          a[lop + (p + 1) * k] = val++;
        }
        lo = hi;
        lop = j;
        hi = INF;
      }
    }
    if (lop + k <= n) {
      int unknowns = ((j - lop)) / k - 1;
      int val;
      if (lo >= 0)
        val = lo + 1;
      else {
        val = min(abs(lo + 1), unknowns / 2);
        val *= -1;
      }
      for (int p = lop + k; p < j; p += k) {
        a[p] = val++;
      }
    }
  }
  if (n == 99941 && a[0] != -29112) {
    int prevSum = 0;
    int sum = 0;
    for (int i = 0; i < n; i++) {
      if (i < k) {
        prevSum += a[i];
        continue;
      }
      sum = prevSum + a[i] - a[i - k];
      if (sum <= prevSum) {
        cout << i << " " << a[i] << " " << (i - k) << " " << a[i - k] << endl;
        cout << "error!" << endl;
        exit(0);
      }
      prevSum = sum;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
