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;
ostream& operator<<(ostream& out, vector<int> v) {
  for (auto a : v) out << a << " ";
  return out;
}
ostream& operator<<(ostream& out, pair<int, int> d) {
  out << d.first << ", " << d.second << " ";
  return out;
}
pair<int, int> operator-(pair<int, int> A, pair<int, int> B) {
  return make_pair((A.first - B.first), (A.second - B.second));
}
pair<int, int> operator+(pair<int, int> A, pair<int, int> B) {
  return make_pair((A.first + B.first), (A.second + B.second));
}
bool is_valid(vector<int>& v) {
  int n = v.size();
  vector<pair<int, int> > d;
  for (int i = 0; i < n; i++) {
    if (v[i] != 2 * (1e9)) {
      d.push_back(make_pair((i), (v[i])));
    }
  }
  for (int i = 1; i < d.size(); i++) {
    pair<int, int> L = d[i - 1];
    pair<int, int> R = d[i];
    int diff = R.first - L.first;
    if (L.second + diff > R.second) {
      return false;
    }
  }
  int m = d.size();
  if (m == 0) {
    vector<int> t;
    t.push_back(0);
    if (t.size() < n) {
      for (int i = 1;; i++) {
        t.push_back(-i);
        if (t.size() == n) break;
        t.push_back(i);
        if (t.size() == n) break;
      }
    }
    sort((t).begin(), (t).end());
    copy((t).begin(), (t).end(), v.begin());
    return true;
  }
  if (d[0].first > 0) {
    if (d[0].second > 0) {
      int count = d[0].first;
      vector<int> t;
      t.push_back(0);
      if (t.size() < count) {
        for (int i = 1;; i++) {
          t.push_back(-i);
          if (t.size() == count) break;
          if (i < d[0].second) t.push_back(i);
          if (t.size() == count) break;
        }
      }
      sort((t).begin(), (t).end());
      copy((t).begin(), (t).end(), v.begin());
    } else {
      int val = d[0].second - 1;
      for (int i = d[0].first - 1; i >= 0; i--) {
        v[i] = val--;
      }
    }
  }
  if (d[m - 1].first < n - 1) {
    if (d[m - 1].second < 0) {
      int count = n - d[m - 1].first - 1;
      vector<int> t;
      t.push_back(0);
      if (t.size() < count) {
        for (int i = 1;; i++) {
          if (d[m - 1].second < -i) t.push_back(-i);
          if (t.size() == count) break;
          t.push_back(i);
          if (t.size() == count) break;
        }
      }
      sort((t).begin(), (t).end());
      copy((t).begin(), (t).end(), v.begin() + d[m - 1].first + 1);
    } else {
      int val = d[m - 1].second + 1;
      for (int i = d[m - 1].first + 1; i < n; i++) {
        v[i] = val++;
      }
    }
  }
  for (int i = 1; i < d.size(); i++) {
    pair<int, int> L = d[i - 1];
    pair<int, int> R = d[i];
    if (L.first + 1 == R.first) continue;
    if (0 <= L.second) {
      int val = L.second + 1;
      for (int j = L.first + 1; j < R.first; j++) {
        v[j] = val++;
      }
    } else if (R.second <= 0) {
      int val = R.second - 1;
      for (int j = R.first - 1; j > L.first; j--) {
        v[j] = val--;
      }
    } else {
      int count = R.first - L.first - 1;
      vector<int> t;
      t.push_back(0);
      if (t.size() < count) {
        for (int i = 1;; i++) {
          if (L.second < -i) t.push_back(-i);
          if (t.size() == count) break;
          if (i < R.second) t.push_back(i);
          if (t.size() == count) break;
        }
      }
      sort((t).begin(), (t).end());
      copy((t).begin(), (t).end(), v.begin() + L.first + 1);
    }
  }
  return true;
}
bool is_valid(vector<vector<int> >& v) {
  for (auto& a : v) {
    if (!is_valid(a)) return false;
  }
  return true;
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<vector<int> > v(k);
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    if (s == "?")
      v[i % k].push_back(2 * (1e9));
    else {
      stringstream ss(s);
      int a;
      ss >> a;
      v[i % k].push_back(a);
    }
  }
  if (!is_valid(v)) {
    cout << "Incorrect sequence" << endl;
  } else {
    for (int i = 0; i < n; i++) {
      cout << v[i % k][i / k] << " ";
    }
    cout << endl;
  }
  return 0;
}
