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 int oo = 1e9 + 1;
void fail() {
  printf("Incorrect sequence\n");
  exit(0);
}
int main() {
  int n, k, x;
  char c;
  scanf("%d %d", &n, &k);
  vector<vector<int> > chain(k);
  for (int i = 0; i < n; ++i) {
    scanf(" %c", &c);
    x = oo;
    if (c != '?') {
      ungetc(c, stdin);
      scanf("%d", &x);
    }
    chain[i % k].push_back(x);
  }
  for (auto &ch : chain) {
    int sz = (int)ch.size();
    if (!sz) continue;
    int lf = 0;
    while (lf < sz && ch[lf] == oo) ++lf;
    if (lf == sz) {
      lf /= 2;
      lf *= -1;
      for (int &el : ch) el = lf++;
      continue;
    }
    if (lf > 0) {
      if (ch[lf] > (lf - 1) / 2) {
        int val = -lf / 2;
        for (int i = 0; i < lf; ++i) {
          ch[i] = val++;
        }
      } else {
        for (int i = lf - 1; i >= 0; --i) {
          ch[i] = ch[i + 1] - 1;
        }
      }
    }
    int prev = ch[lf];
    while (lf < sz - 1) {
      int rg = lf + 1;
      while (rg < sz && ch[rg] == oo) ++rg;
      int tam = rg - lf - 1;
      if (rg == sz) {
        if (prev < -(tam - 1) / 2) {
          int val = tam / 2;
          for (int i = sz - 1; i > lf; --i) {
            ch[i] = val--;
          }
        } else {
          for (int i = lf + 1; i < sz; ++i) {
            ch[i] = ch[i - 1] + 1;
          }
        }
        break;
      }
      tam /= 2;
      if (prev + rg - lf > ch[rg]) fail();
      if (prev >= -tam) {
        for (int i = lf + 1; i < rg; ++i) {
          ch[i] = ch[i - 1] + 1;
        }
      } else if (ch[rg] <= tam) {
        for (int i = rg - 1; i > lf; --i) {
          ch[i] = ch[i + 1] - 1;
        }
      } else {
        int val = -tam;
        for (int i = lf + 1; i < rg; ++i) ch[i] = val++;
      }
      lf = rg;
      prev = ch[rg];
    }
  }
  for (int i = 0, x = 0, y = 0; i < n; ++i) {
    printf("%d ", chain[x][y]);
    ++x;
    if (x == k) x = 0, ++y;
  }
  puts("");
  return 0;
}
