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;
const double EPS = 1e-9;
const int INF = ((int)1e9) + 7;
int toint(string tmp) {
  bool t = (tmp[0] == '-');
  int l = 0;
  if (t) {
    l = 1;
  }
  int ans = 0;
  for (int i = l; i < tmp.size(); i++) {
    ans *= 10;
    ans += (tmp[i] - '0');
  }
  if (t) {
    ans *= -1;
  }
  return ans;
}
int main() {
  int n, k;
  string tmp;
  getline(cin, tmp);
  int lll = 0;
  for (int i = 0; i < tmp.size(); i++) {
    if (tmp[i] != ' ') {
      lll++;
    } else {
      break;
    }
  }
  n = toint(tmp.substr(0, lll));
  k = toint(tmp.substr(lll + 1, tmp.size() - lll - 1));
  vector<int> a;
  tmp.clear();
  getline(cin, tmp);
  for (int i = 0; i < tmp.size(); i++) {
    if (tmp[i] == '?') {
      a.push_back(INF);
    } else if (tmp[i] != ' ') {
      int len = 0;
      for (int j = i; j < tmp.size(); j++) {
        if (tmp[j] != ' ') {
          len++;
        } else {
          break;
        }
      }
      a.push_back(toint(tmp.substr(i, len)));
      i += len;
    }
  }
  for (int i = 0; i < k; i++) {
    int l = -1, j;
    for (j = 0; k * j + i < n; j++) {
      int y = k * j + i;
      if (l > -1 && a[y] != INF) {
        if (a[y] >= 0 && a[k * l + i] >= 0) {
          for (int q = l + 1; q < j; q++) {
            a[k * q + i] = a[k * (q - 1) + i] + 1;
          }
        } else if (a[y] < 0 && a[k * l + i] < 0) {
          for (int q = j - 1; q > l; q--) {
            a[k * q + i] = a[k * (q + 1) + i] - 1;
          }
        } else if (a[y] >= 0 && a[k * l + i] < 0) {
          int tmp = max(0, (j - l - 2) / 2);
          if (max(0, (j - l - 2)) % 2 != 0) {
            tmp++;
          }
          if (a[y] <= tmp) {
            for (int q = j - 1; q > l; q--) {
              a[k * q + i] = a[k * (q + 1) + i] - 1;
            }
          } else if (a[k * l + i] >= -tmp) {
            for (int q = l + 1; q < j; q++) {
              a[k * q + i] = a[k * (q - 1) + i] + 1;
            }
          } else {
            tmp *= -1;
            for (int q = l + 1; q < j; q++) {
              a[k * q + i] = tmp;
              tmp++;
            }
          }
        }
        l = j;
      }
      if (l == -1 && a[y] != INF) {
        l = j;
      }
      if (l == -2 && a[y] != INF) {
        l = -1;
        if (a[y] < 0) {
          for (int q = j - 1; q > l; q--) {
            a[k * q + i] = a[k * (q + 1) + i] - 1;
          }
        } else {
          int tmp = (j - 1) / 2;
          if (a[y] <= tmp) {
            for (int q = j - 1; q > l; q--) {
              a[k * q + i] = a[k * (q + 1) + i] - 1;
            }
          } else {
            if ((j - 1) % 2 != 0) {
              tmp++;
            }
            tmp *= -1;
            for (int q = l + 1; q < j; q++) {
              a[k * q + i] = tmp;
              tmp++;
            }
          }
        }
        l = j;
      }
      if (l == -1 && a[y] == INF) {
        l = -2;
      }
    }
    if (j != l) {
      int y = k * j + i;
      if (a[k * l + i] >= 0) {
        for (int q = l + 1; q < j; q++) {
          a[k * q + i] = a[k * (q - 1) + i] + 1;
        }
      } else {
        int tmp = max(0, (j - l - 2) / 2);
        if (a[k * l + i] >= -tmp) {
          for (int q = l + 1; q < j; q++) {
            a[k * q + i] = a[k * (q - 1) + i] + 1;
          }
        } else {
          tmp *= -1;
          for (int q = l + 1; q < j; q++) {
            a[k * q + i] = tmp;
            tmp++;
          }
        }
      }
    }
    vector<int> tmp, ch;
    for (int j = 0; k * j + i < n; j++) {
      int y = k * j + i;
      tmp.push_back(a[y]);
    }
    ch = tmp;
    sort(ch.begin(), ch.end());
    if (ch != tmp) {
      cout << "Incorrect sequence";
      return 0;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
