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 int powmod(long long int a, int b, int n) {
  long long int rm = 1;
  while (b) {
    if (b % 2) {
      rm = (rm * a) % n;
    }
    a = (a * a) % n;
    b /= 2;
  }
  return rm;
}
int n, k, a[int(1e5 + 10)] = {0};
string s;
void solvechain(int start) {
  int prv = -1e9 - 10, fwd, question = 0, p1, p2, iter, st, ed, ggg;
  ggg = 1e9 + 10;
  for (int i = start; i <= n; i += k) {
    if (a[i] > 1e9) {
      question++;
      ggg = min(ggg, i);
    }
    if (a[i] <= 1e9 || (question && i + k > n)) {
      if (!question) {
        prv = a[i];
      } else if (question) {
        int mnlimit = prv + 1, mxlimit = a[i] - 1, beforezero, afterzero;
        if (mxlimit <= 0) {
          afterzero = a[i] + 4;
          beforezero = mxlimit;
        } else if (mnlimit > 0) {
          beforezero = prv - 4;
          afterzero = mnlimit;
        } else {
          beforezero = 0, afterzero = 1;
        }
        p1 = beforezero, p2 = afterzero;
        iter = question;
        while (iter--) {
          if (p1 < mnlimit) {
            p2++;
          } else if (p2 > mxlimit) {
            p1--;
          } else {
            if (abs(p1) < abs(p2))
              p1--;
            else
              p2++;
          }
        }
        st = p1 + 1, ed = p2 - 1;
        if (st < prv) {
          st = mnlimit;
        }
        if (ed > a[i]) {
          ed = mxlimit;
        }
        for (int o = 1; o <= question; ++o) {
          a[ggg] = st++;
          ggg += k;
        }
        question = 0;
        ggg = 1e9 + 10;
      }
    }
  }
}
int main() {
  cin >> n >> k;
  int question = 0;
  for (int i = int(1); i <= (int)n; i++) {
    cin >> s;
    if (s[0] == '?') {
      a[i] = 1e9 + 10;
    } else {
      if (s[0] == '-') {
        for (int ih = 1; ih < s.size(); ++ih) a[i] = a[i] * 10 + (s[ih] - 48);
        a[i] = -a[i];
      } else
        for (int ih = 0; ih < s.size(); ++ih) a[i] = a[i] * 10 + (s[ih] - 48);
    }
  }
  for (int i = 1; i <= n; ++i) {
  }
  int prv = -1e9 - 10;
  for (int i = 1; i <= k; ++i) {
    question = 0;
    prv = -1e9 - 10;
    for (int j = i; j <= n; j += k) {
      if (a[j] > 1e9) {
        question++;
      } else {
        if (a[j] - prv <= question) {
          cout << "Incorrect sequence\n";
          return 0;
        }
        question = 0;
        prv = a[j];
      }
    }
  }
  for (int i = 1; i <= k; ++i) {
    solvechain(i);
  }
  for (int i = 1; i <= n; ++i) {
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
