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;
struct elem {
  long long int val;
  bool h;
};
long long int N, L, K, sol[200010];
vector<elem> b[200010];
char s[5000000];
int main() {
  cin >> N >> K;
  cin.ignore();
  fgets(s, 5000000, stdin);
  L = strlen(s);
  L--;
  s[L] = ' ';
  long long int i, j, nr = 0, t = 0;
  bool n = 0;
  elem aux;
  for (i = 0; i <= L; i++) {
    if (s[i] == '-') {
      n = 1;
      continue;
    } else if (s[i] == '?')
      continue;
    else if (s[i] == ' ') {
      t++;
      if (s[i - 1] == '?')
        aux.val = 0, aux.h = 1;
      else
        aux.val = nr, aux.h = 0;
      if (n) aux.val *= -1;
      b[t % K].push_back(aux);
      nr = 0;
      n = 0;
    } else
      nr = nr * 10 + s[i] - '0';
  }
  long long int r = 0, k, l;
  for (i = 0; i < K; i++) {
    r = 0;
    for (r = 0; r < b[i].size(); r++)
      if (!b[i][r].h) break;
    if (b[i][0].h) {
      if (r == b[i].size()) {
        k = b[i].size() / 2;
        k = -k;
        for (j = 0; j < b[i].size(); j++) b[i][j].val = k, k++;
        continue;
      } else {
        k = r / 2;
        k = -k;
        if (k + r - 1 >= b[i][r].val) k = b[i][r].val - r;
        for (j = 0; j < r; j++) b[i][j].val = k, k++;
      }
    }
    while (r != b[i].size()) {
      l = r;
      for (r = r + 1; r < b[i].size(); r++)
        if (!b[i][r].h) break;
      if (r - l < 2) continue;
      if (r == b[i].size()) {
        k = (r - l - 1) / 2;
        k = -k;
        if (k <= b[i][l].val) k = b[i][l].val + 1;
        for (j = l + 1; j < r; j++) b[i][j].val = k, k++;
      } else {
        if (r - l - 1 > b[i][r].val - b[i][l].val - 1 ||
            b[i][r].val <= b[i][l].val) {
          cout << "Incorrect sequence\n";
          return 0;
        }
        if (b[i][r].val <= 0)
          for (j = r - 1; j > l; j--) b[i][j].val = b[i][j + 1].val - 1;
        else if (b[i][l].val >= 0)
          for (j = l + 1; j < r; j++) b[i][j].val = b[i][j - 1].val + 1;
        else {
          k = (r - l - 1) / 2;
          k = -k;
          if (k <= b[i][l].val) k = b[i][l].val + 1;
          if (k + r - l - 2 >= b[i][r].val) k = b[i][r].val - r + l + 1;
          for (j = l + 1; j < r; j++) b[i][j].val = k, k++;
        }
      }
    }
  }
  for (i = 0; i < K; i++)
    for (j = 0; j < b[i].size(); j++)
      sol[j * K + (i == 0 ? K : i)] = b[i][j].val;
  for (i = 1; i <= N - K; i++)
    if (sol[i] >= sol[i + K]) {
      cout << "Incorrect sequence\n";
      return 0;
    }
  for (i = 1; i <= N; i++) cout << sol[i] << " ";
  cout << "\n";
  return 0;
}
