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 java.util.*;
import java.io.*;
public class E {
    public static PrintWriter out = new PrintWriter(System.out);
    public static InputReader in = new InputReader(System.in);
    public static void main(String args[]) {
        int K, N;
        N = in.nextInt();
        K = in.nextInt();
        String[] a = new String[N + K];
        for (int i = 0; i < N; i++) {
            a[i] = in.next();
        }
        for (int i = N; i < N + K; i++) {
            a[i] = "" + Integer.MAX_VALUE;
        }
        // out.println(N + " " + K);
        N += K;
        for (int i = 0; i < K; i++) {
            long prev = Integer.MIN_VALUE;
            int q = 0;
            for (int j = i; j < N; j += K) {
                if (a[j].equals("?")) {
                    q++;
                } else {
                    long cur = Long.parseLong(a[j]);
                    long room = (cur - 1) - (prev + 1) + 1;
                    if (cur > prev && room >= q) {
                        // out.println(prev + " " + cur + " " + q);
                        if (q == 0) {
                            // NOTHING
                        } else if (prev >= 0) {
                            int l2 = j;
                            for (int l = 0; l < q; l++) {
                                l2 -= K;
                                a[l2] = "" + (prev + q - l);
                            }
                            q = 0;
                        } else if (cur <= 0) {
                            int l2 = j;
                            for (int l = 0; l < q; l++) {
                                l2 -= K;
                                a[l2] = "" + (cur - l - 1);
                            }
                            q = 0;
                        } else {
                            ArrayList<Long> vals = new ArrayList<Long>();
                            long curr = 1;
                            vals.add(0L);
                            while (vals.size() < q) {
                                if (prev < curr && curr < cur) {
                                    vals.add(curr);
                                }
                                if (curr > 0) {
                                    curr = -curr;
                                } else {
                                    curr = -curr;
                                    curr++;
                                }
                            }
                            Collections.sort(vals);
                            int l2 = j;
                            for (int l3 = 0; l3 < q; l3++) {
                                l2 -= K;
                                a[l2] = "" + vals.get(q - l3 - 1);
                            }
                            q = 0;
                        }
                    } else {
                        NO();
                    }
                    prev = cur;
                }
            }
        }
        // out.println(N + " " + K);
        for (int i = 0; i < N - K; i++) {
            if (i != 0) out.print(" ");
            out.print(a[i]);
        }
        out.println();
        out.close();
    }
    static void NO() {
        out.println("Incorrect sequence");
        out.close();
        System.exit(0);
    }
}
class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
    public InputReader(InputStream stream) {
	reader = new BufferedReader(new InputStreamReader(stream), 32768);
	tokenizer = null;
    }
    public String next() {
	while (tokenizer == null || !tokenizer.hasMoreTokens()) {
	    try {
		tokenizer = new StringTokenizer(reader.readLine());
	    } catch (IOException e) {
		throw new RuntimeException(e);
	    }
	}
	return tokenizer.nextToken();
    }
    public double nextDouble() {
	return Double.parseDouble(next());
    }
    public long nextLong() {
	return Long.parseLong(next());
    }
    public int nextInt() {
	return Integer.parseInt(next());
    }
}
