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 

//package codeforces.cfr293div2;

import java.util.Scanner;

/**
 * Created by bistrashkin on 2/25/15.
 */
public class E {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        Integer[] a = new Integer[n];

        for (int i = 0; i < n; i++) {
            String next = in.next();
            if (!next.equals("?")) {
                a[i] = Integer.valueOf(next);
            }
        }

        // initial check
        boolean invalid = false;
        for (int i = 0; i < n-k; i++) {
            if (a[i+k] != null && a[i] != null && a[i+k] < a[i]) {
                invalid = true;
                break;
            }
        }

        if (invalid) {
            System.out.println("Incorrect sequence");
            return;
        }

        for (int i = 0; i < n; i++) {
            if (a[i] == null) {
                // find lower known
                int startI;
                Integer startV = null;
                for (startI = i; startI >= 0; startI -= k) {
                    if (a[startI] != null) {
                        startV = a[startI];
                        break;
                    }
                }
                startI += k;
                // find upper known
                int endI;
                Integer endV = null;
                for (endI = i; endI < n; endI += k) {
                    if (a[endI] != null) {
                        endV = a[endI];
                        break;
                    }
                }
                endI -= k;
                // count of unknowns
                int count = 1 + (endI - startI) / k;
                int initV;

                // nothing known + 1; )
                if (startV == null && endV == null) {
                    initV = -count / 2;
                } else if (startV == null && endV != null) {
                    if (endV > 0) {
                        initV = Math.min(-count / 2, endV - count);
                    } else {
                        initV = endV - count;
                    }
                } else if (startV != null && endV == null) {
                    if (startV < 0) {
                        initV = Math.max(-count / 2, startV + 1);
                    } else {
                        initV = startV + 1;
                    }
                } else {
                    if (startV + count >= endV) {
                        invalid = true;
                        break;
                    } else {
                        initV = Math.max(-count/2, startV + 1);
                        initV = Math.min(initV, endV - count);
                    }
                }
                a[startI] = initV;
                for (int j = 1; j <= count; j++) {
                    a[startI + j * k] = a[startI + (j - 1) * k] + 1;
                }
            }
        }

        if (invalid) {
            System.out.println("Incorrect sequence");
            return;
        }
        StringBuilder sb = new StringBuilder();
        sb.append(a[0]);
        for (int i = 1; i < n; i++) {
            sb.append(" ").append(a[i]);
        }
        System.out.println(sb.toString());
    }
}
