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;
long long a[100000], mn[100000];
bool v[100000], p[100000];
unsigned int ix[100000];
char q[20];
unsigned int qs[100000], nqs;
int main(int argc, char* argv[]) {
  unsigned int n, k;
  cin >> n >> k;
  fill(mn, mn + k, -1000000001);
  bool ok = true;
  for (unsigned int i = 0; i < n; ++i) {
    cin >> q;
    if (q[0] != '?') {
      p[i] = true;
      a[i] = atoi(q);
      unsigned int si = i % k;
      if (v[si]) {
        if (mn[si] >= a[i]) {
          ok = false;
          break;
        }
      } else {
        v[si] = true;
        mn[si] = a[i];
        ix[si] = i;
      }
    } else
      qs[nqs++] = i;
  }
  if (ok) {
    for (unsigned int i = 0; i < nqs; ++i) {
      if (p[qs[i]]) continue;
      unsigned int si = qs[i] % k;
      if (!v[si]) {
        long long d = n / (2 * k);
        d = -d;
        for (unsigned int j = qs[i]; j < n; j += k) {
          p[j] = true;
          a[j] = d;
          ++d;
        }
      } else {
        if (qs[i] < ix[si]) {
          long long am = (ix[si] - qs[i]) / k;
          if (mn[si] < -1000000000 + am) {
            ok = false;
            break;
          }
          long long d = min(mn[si] - k, -((long long)n / (2 * k)));
          for (unsigned int j = qs[i]; j < ix[si]; j += k) {
            p[j] = true;
            a[j] = d;
            ++d;
          }
        } else {
          long long mns = a[qs[i] - k];
          unsigned int mxi = qs[i] + k;
          for (; mxi < n && !p[mxi]; mxi += k)
            ;
          if (mxi >= n) {
            mxi -= k;
            long long am = (mxi - qs[i]) / k;
            if (mns + am > 1000000000) {
              ok = false;
              break;
            }
            long long d = max(mns + 1, -((long long)n / (2 * k)));
            for (unsigned int j = qs[i]; j < n; j += k) {
              p[j] = true;
              a[j] = d;
              ++d;
            }
          } else {
            long long am = (mxi - qs[i]) / k;
            if (mns + am >= a[mxi]) {
              ok = false;
              break;
            }
            long long d = -((long long)n / (2 * k));
            if (d < mns)
              d = mns + 1;
            else if (d + am > a[mxi])
              d = a[mxi] - am;
            for (unsigned int j = qs[i]; j < mxi; j += k) {
              p[j] = true;
              a[j] = d;
              ++d;
            }
          }
        }
      }
    }
  }
  if (!ok)
    cout << "Incorrect sequence\n";
  else {
    cout << a[0];
    for (unsigned int i = 1; i < n; ++i) cout << ' ' << a[i];
    cout << endl;
  }
  return 0;
}
