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;
string s[100010];
long long tolol(string s) {
  long long ans(0), b(1);
  for (auto x : s) {
    if (x == '-')
      b *= -1;
    else
      ans = ans * 10 + b * (x - 48);
  }
  return ans;
}
string toString(long long a) {
  if (a == 0) return "0";
  string s, d;
  if (a < 0) d = "-", a *= -1;
  while (a) {
    s = char(a % 10 + 48) + s;
    a /= 10;
  }
  return d + s;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long n, k, i, j, last, lasi, cur;
  cin >> n >> k;
  for (i = 1; i <= n; i++) {
    cin >> s[i];
  }
  for (i = 1; i <= k; i++) {
    last = -2000000000;
    lasi = i - k;
    for (j = i; j <= n; j += k) {
      if (s[j] != "?") {
        cur = tolol(s[j]);
        if ((j - lasi) / k - 1 > cur - last - 1) {
          cout << "Incorrect sequence\n";
          return 0;
        }
        if (cur <= 0) {
          for (long long q = j - k; q > lasi; q -= k)
            cur--, s[q] = toString(cur);
        } else if (last >= 0) {
          for (long long q = lasi + k; q < j; q += k)
            last++, s[q] = toString(last);
        } else {
          cur = ((j - lasi - k) / k) / 2;
          if (cur - last - 1 >= (j - lasi) / k - 1)
            for (long long q = j - k; q > lasi; q -= k)
              s[q] = toString(cur), cur--;
          else
            for (long long q = lasi + k; q < j; q += k)
              last++, s[q] = toString(last);
        }
        last = tolol(s[j]);
        lasi = j;
      }
    }
    if (lasi + k <= n) {
      cur = 2000000000;
      if (cur <= 0) {
        for (long long q = j - k; q > lasi; q -= k) cur--, s[q] = toString(cur);
      } else if (last >= 0) {
        for (long long q = lasi + k; q < j; q += k)
          last++, s[q] = toString(last);
      } else {
        cur = ((j - lasi - k) / k) / 2;
        if (cur - last - 1 >= (j - lasi) / k - 1)
          for (long long q = j - k; q > lasi; q -= k)
            s[q] = toString(cur), cur--;
        else
          for (long long q = lasi + k; q < j; q += k)
            last++, s[q] = toString(last);
      }
    }
  }
  for (i = 1; i <= n; i++) cout << s[i] << ' ';
  return 0;
}
