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 MOD = 1000000007;
int a[100100];
int findOptimal(int l, int h, int len) {
  if (l >= 0) return l;
  if (h + len <= 0) return h;
  if (l + l + len - 1 >= 0) return l;
  int delta = abs(l + l + len - 1) / 2;
  delta = min(delta, h - l);
  return l + delta;
}
bool solve(vector<int>& inp) {
  inp.push_back(MOD + 200000);
  reverse(inp.begin(), inp.end());
  inp.push_back(-1000200001);
  reverse(inp.begin(), inp.end());
  for (int i = 0; i < inp.size(); i += 1) {
    if (inp[i] == MOD) {
      int s = i, e = i;
      while (e < inp.size() and inp[e] == MOD) e += 1;
      int low = inp[s - 1] + 1;
      int high = inp[e] - 1;
      if (high - low + 1 < e - s) return false;
      high = inp[e] - (e - s);
      int optimal = findOptimal(low, high, e - s);
      for (int j = s; j < e; ++j) inp[j] = optimal++;
    }
  }
  inp.pop_back();
  reverse(inp.begin(), inp.end());
  inp.pop_back();
  reverse(inp.begin(), inp.end());
  for (int i = 1; i < inp.size(); ++i)
    if (inp[i] <= inp[i - 1]) return false;
  return true;
}
int main() {
  int n, k;
  string x;
  cin >> n >> k;
  for (int i = 0; i < (n); ++i) {
    cin >> x;
    if (x == "?")
      a[i] = MOD;
    else
      a[i] = atoi(x.c_str());
  }
  vector<int> v;
  for (int i = 0; i < k; ++i) {
    for (int j = i; j < n; j += k) {
      v.push_back(a[j]);
    }
    bool f = solve(v);
    if (!f) {
      cout << "Incorrect sequence\n";
      return 0;
    }
    for (int j = i, jj = 0; j < n; j += k, jj += 1) {
      a[j] = v[jj];
    }
    v.clear();
  }
  for (int i = 0; i < (n); ++i) cout << a[i] << " ";
  cout << endl;
  return 0;
}
