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 process(string &second) {
  if (second == "?") return 10000000000000000;
  if (second[0] == '-') {
    long long ans = 0;
    for (int i = 1; i < second.length(); i++) {
      ans += (second[i] - '0');
      ans *= 10;
    }
    ans /= 10;
    ans *= -1;
    return ans;
  }
  long long ans = 0;
  for (auto x : second) {
    ans += (x - '0');
    ans *= 10;
  }
  ans /= 10;
  return ans;
}
vector<long long> solve(vector<long long> v) {
  bool ok = 1;
  for (auto x : v) {
    if (x != 10000000000000000) ok = 0;
  }
  if (ok) {
    int cur = v.size();
    int l = 0;
    int r = v.size() - 1;
    long long e = cur;
    if (v.size() & 1) {
      for (int i = 0; i < v.size(); i++) {
        if (l > r) break;
        v[l] = -cur;
        v[r] = cur;
        e = min(e, abs(v[l]));
        e = min(e, abs(v[r]));
        l++;
        r--;
        cur--;
      }
    } else {
      for (int i = 0; i < v.size(); i++) {
        if (l > r) break;
        v[l] = -cur;
        v[r] = cur - 1;
        e = min(e, abs(v[l]));
        e = min(e, abs(v[r]));
        l++;
        r--;
        cur--;
      }
    }
    for (auto &x : v) {
      if (x < 0)
        x += e;
      else
        x -= e;
    }
    return v;
  }
  long long prev = -10000000000000000;
  int ind;
  for (int i = 0; i < v.size(); i++) {
    if (v[i] != 10000000000000000) {
      if (prev == -10000000000000000) {
        if (v[i] > 0) {
          if (i == 0) {
            prev = v[i];
            ind = i;
            continue;
          }
          long long val = 10000000000000000;
          long long r = -1;
          long long tmp = 10000000000000000;
          for (int j = 0; j < i; j++) {
            if (v[i] > i - j - 1) {
              tmp = j * (j + 1) + (i - j) * (i - j - 1);
              tmp /= 2;
              if (val > tmp) {
                val = tmp;
                r = j;
              }
            }
          }
          if (r != -1) v[r] = 0;
          for (int j = r - 1; j >= 0; j--) {
            v[j] = v[j + 1] - 1;
          }
          for (int j = r + 1; j < i; j++) {
            v[j] = v[j - 1] + 1;
          }
        } else if (v[i] <= 0) {
          for (int j = i - 1; j >= 0; j--) {
            v[j] = v[j + 1] - 1;
          }
        }
      } else {
        if (i - ind > v[i] - prev) {
          cout << "Incorrect sequence1";
          exit(0);
        } else {
          if (prev < 0 and v[i] > 0) {
            if (ind == i - 1) {
              prev = v[i];
              ind = i;
              continue;
            }
            long long val = 10000000000000000;
            long long r = -1;
            long long tmp = 10000000000000000;
            for (int j = ind + 1; j < i; j++) {
              tmp = (j - ind - 1) * (j - ind) + (i - j - 1) * (i - j);
              if (tmp < val) {
                val = tmp;
                r = j;
              }
            }
            if (r != -1) v[r] = 0;
            for (int j = r - 1; j > ind; j--) {
              v[j] = j - r;
            }
            for (int j = r + 1; j < i; j++) {
              v[j] = j - r;
            }
          } else {
            if (v[i] > 0) {
              for (int j = ind + 1; j < i; j++) {
                v[j] = v[j - 1] + 1;
              }
            } else {
              for (int j = i - 1; j > ind; j--) {
                v[j] = v[j + 1] - 1;
              }
            }
          }
        }
      }
      prev = v[i];
      ind = i;
    }
  }
  if (v.back() == 10000000000000000) {
    if (prev < 0) {
      long long val = 10000000000000000;
      long long r = -1;
      long long tmp = 10000000000000000;
      for (int j = ind + 1; j < v.size(); j++) {
        if (prev < j - ind - 1) {
          tmp = (j - ind) * (j - ind - 1) + (v.size() - 1 - j) * (v.size() - j);
          tmp /= 2;
          if (val > tmp) {
            val = tmp;
            r = j;
          }
        }
      }
      if (r != -1) v[r] = 0;
      for (int j = r - 1; j > ind; j--) {
        v[j] = j - r;
      }
      for (int j = r + 1; j < v.size(); j++) {
        v[j] = j - r;
      }
    } else {
      for (int j = ind + 1; j < v.size(); j++) {
        v[j] = v[j - 1] + 1;
      }
    }
  }
  return v;
}
int main() {
  int n, k;
  cin >> n >> k;
  long long a[n];
  string second;
  for (int i = 0; i < n; i++) cin >> second, a[i] = process(second);
  for (int i = 0; i < k; i++) {
    vector<long long> v;
    for (int j = i; j < n; j += k) {
      v.emplace_back(a[j]);
    }
    v = solve(v);
    int l = 0;
    for (int j = i; j < n; j += k) {
      a[j] = v[l];
      l++;
    }
  }
  for (int i = k; i < n; i++) {
    if (a[i] <= a[i - k]) {
      cout << "Incorrect sequence";
      exit(0);
    }
  }
  for (int i = 0; i < n; i++) cout << a[i] << " ";
}
