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;
template <typename T>
inline void mx(T& x, const T& y) {
  if (x < y) x = y;
}
template <typename T>
inline void mn(T& x, const T& y) {
  if (y < x) x = y;
}
template <typename T>
inline int sz(const T& x) {
  return (int)x.size();
}
const int UNDEF = 1e9 + 1e7;
const int MAX = 1e9 + 1e6;
const long long INF = 1e18 + 1e6;
long long sum(long long r) {
  if (r <= 0) {
    return 0;
  }
  long long l = r + 1;
  if (l & 1) {
    r >>= 1;
  } else {
    l >>= 1;
  }
  return l * r;
}
long long score(long long l, long long r) {
  if (l < 0 && r > 0) {
    return score(l, 0) + score(0, r);
  }
  if (l < 0) {
    return score(-r, -l);
  }
  return sum(r) - sum(l - 1);
}
void gen(int l, int r, int count, vector<int>::iterator out) {
  if (count % 2 == 1) {
    int half = count / 2;
    int left = -half;
    int right = half;
    if (l < left && right < r) {
      for (int i = 0; i < (count); ++i) {
        *(out++) = left + i;
      }
      return;
    }
  } else {
    int half = count / 2;
    int left1 = -half;
    int right1 = half - 1;
    if (l < left1 && right1 < r) {
      for (int i = 0; i < (count); ++i) {
        *(out++) = left1 + i;
      }
      return;
    }
    int left2 = -(half - 1);
    int right2 = half;
    if (l < left2 && right2 < r) {
      for (int i = 0; i < (count); ++i) {
        *(out++) = left2 + i;
      }
      return;
    }
  }
  long long way1 = score(l + 1, l + count);
  long long way2 = score(r - count, r - 1);
  long long minWay = min(way1, way2);
  if (way1 == minWay) {
    for (int i = 0; i < (count); ++i) {
      *(out++) = l + 1 + i;
    }
    return;
  }
  if (way2 == minWay) {
    for (int i = 0; i < (count); ++i) {
      *(out++) = r - count + i;
    }
    return;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < (n); ++i) {
    string s;
    cin >> s;
    if (s == "?") {
      a[i] = UNDEF;
    } else {
      a[i] = atoi(s.c_str());
    }
  }
  for (int i = 0; i < (k); ++i) {
    vector<int> b;
    for (int j = i; j < n; j += k) {
      b.push_back(a[j]);
    }
    b.insert(b.begin(), -MAX);
    b.push_back(+MAX);
    for (int l = 0; l + 1 < sz(b);) {
      int r = l + 1;
      while (r < sz(b) && b[r] == UNDEF) {
        r++;
      }
      if (b[r] - b[l] < r - l) {
        cout << "Incorrect sequence" << endl;
        return 0;
      }
      gen(b[l], b[r], r - l - 1, b.begin() + l + 1);
      l = r;
    }
    b.erase(b.begin());
    b.pop_back();
    for (int j = 0; j < (sz(b)); ++j) {
      a[i + j * k] = b[j];
    }
  }
  for (int x : a) {
    cout << x << ' ';
  }
  cout << endl;
  return 0;
}
