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;
#pragma comment(linker, "/STACK:1024000000,1024000000")
int a[100020];
int n, k;
vector<int> g[100020];
char s[20];
int f() {
  if (s[0] == '?') return 0x3f3f3f3f;
  bool flag = 0;
  int i = 0;
  if (s[0] == '-') {
    flag = 1;
    ++i;
  }
  int ret = 0;
  for (; s[i]; ++i) ret = ret * 10 + s[i] - '0';
  if (flag) ret = -ret;
  return ret;
}
int q[100020];
bool calc(int i) {
  int len = g[i].size();
  int pre = -0x3f3f3f3f;
  for (int j = 0; j < len; ++j) {
    if (g[i][j] == 0x3f3f3f3f) continue;
    if (g[i][j] <= pre) return 0;
    pre = g[i][j];
  }
  int l = -0x3f3f3f3f, r = 0x3f3f3f3f;
  int j = 0;
  while (j < len) {
    if (g[i][j] != 0x3f3f3f3f) {
      l = g[i][j];
      ++j;
      continue;
    }
    int v = j;
    while (v < len && g[i][v] == 0x3f3f3f3f) ++v;
    int x = v - j;
    if (v < len)
      r = g[i][v];
    else
      r = 0x3f3f3f3f;
    if (r - l - 1 < x) return 0;
    if (r <= 0) {
      for (int u = 0; u < x; ++u) {
        g[i][v - u - 1] = r - u - 1;
      }
    } else if (l >= 0) {
      for (int u = 0; u < x; ++u) g[i][j + u] = l + u;
    } else {
      int head = 0, tail = 0;
      q[tail++] = 0;
      for (int i = 1;; ++i) {
        if (tail == x) break;
        if (i < r) {
          q[tail++] = i;
        }
        if (tail == x) break;
        if (-i > l) {
          q[tail++] = i;
        }
      }
      sort(q, q + tail);
      for (int u = 0; u < tail; ++u) g[i][u + j] = q[u];
    }
    l = g[i][v];
    j = v + 1;
  }
  return 1;
}
int main() {
  while (scanf("%d%d", &n, &k) != EOF) {
    for (int i = 0; i < n; ++i) {
      scanf("%s", s);
      g[i % k].push_back(f());
    }
    bool flag = 1;
    for (int i = 0; i < k; ++i)
      if (!calc(i)) {
        flag = 0;
        break;
      }
    if (!flag)
      puts("Incorrect sequence");
    else
      for (int i = 0; i < n; ++i)
        printf("%d%c", g[i % k][i / k], i == n - 1 ? '\n' : ' ');
  }
  return 0;
}
