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 

import math

n, k = map(int, input().split())
strings = list(input().split())
a = []
MIN = -1000 * 1000 * 1000 * 1000


def prove(pos):

    index = pos
    while index < len(a):
        if a[index] != MIN:
            return False;
        index += k

    element = -((index - pos) // k - 1) // 2

    index = pos
    while index < len(a):
        a[index] = element
        element += 1
        index += k

    return True


def begin(pos):
    if a[pos] != MIN:
        return pos
    first = pos
    length = 0
    while a[first] == MIN:
        first += k
        length += 1
    element = min(a[first] - length, -((first - pos) // k - 1) // 2)
    while pos < first:
        a[pos] = element
        element += 1
        pos += k

    return first


def end(pos, index):
    pos += k
    if pos == index or pos >= len(a):
        return
    element = max(a[pos - k] + 1, -((index - pos) // k - 1) // 2);
    while pos < len(a):
        a[pos] = element
        element += 1
        pos += k


def fill(l, r):
    if (r - l) // k - 1 > a[r] - a[l] - 1:
        print("Incorrect sequence")
        exit(0)
    cnt = (r - l) // k - 1

    if a[l] >= 0:
        element = a[l] + 1

    if a[r] <= 0:
        element = a[r] - cnt

    if (a[r] >= 0) and (a[l] <= 0):
        element = max(min(-(cnt // 2), a[r] - cnt), a[l] + 1)

    l += k
    while l < r:
        a[l] = element
        element += 1
        l += k


def update(pos):
    if prove(pos):
        return

    pos = begin(pos)
    index = pos + k
    while index < len(a):
        index = pos + k
        while index < len(a) and a[index] == MIN:
            index += k
        if index >= len(a):
            break
        fill(pos, index)
        pos = index

    end(pos, index)


def print_array():
    for x in a:
        print(x, end = ' ')


for x in strings:
    if x == '?':
        a.append(MIN)
    else:
        a.append(int(x))

for i in range(0, k):
    update(i)

print_array()