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.io.*;
import java.util.StringTokenizer;

public class A {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

	void solve() throws IOException {
        int n = readInt();
        int k = readInt();

        long[] a = new long[n + k];
        boolean[] u = new boolean[n + k];
        for(int i = 0; i < n; i++) {
            String x = readString();
            if(x.equals("?")) {
                u[i] = false;
            } else {
                u[i] = true;
                a[i] = Integer.parseInt(x);
            }
        }
        for(int i = n; i < n + k; i++) {
            u[i] = true;
            a[i] = 1000 * 1000 * 1000 * 2;
        }
        for(int i = 0; i < k; i++) {
            int start = -1;
            int cnt = 0;
            long prev = -1000 * 1000 * 1000 * 2;
            for(int j = i; j < n + k; j+= k) {
                if(u[j]) {
                    if(a[j] - prev <= cnt) {
                        out.println("Incorrect sequence");
                        return;
                    }
                    if(start != -1) {
                        if(prev < 0 && a[j] < 0) {
                            int curIndex = j - k;
                            long cur = a[j]-1;
                            while (cnt > 0) {
                                a[curIndex] = cur--;
                                curIndex -= k;
                                cnt--;
                            }
                        } else if(prev < 0 && a[j] >= 0) {
                            int curIndex = j - k;
                            long cur;
                            if(cnt % 2 != 0) {
                                int opt = cnt / 2;
                                if(prev + cnt <= opt && opt <= a[j]-1) {
                                    cur = opt;
                                } else if(opt < prev + cnt) {
                                    cur = prev + cnt;
                                } else {
                                    cur = a[j] - 1;
                                }
                            } else {
                                int opt = cnt / 2;
                                int opt2 = cnt/2-1;
                                if(prev + cnt <= opt && opt <= a[j]-1) {
                                    cur = opt;
                                } else if(prev + cnt <= opt2 && opt2 <= a[j]-1) {
                                    cur = opt2;
                                }else if(opt < prev + cnt) {
                                    cur = prev + cnt;
                                } else {
                                    cur = a[j] - 1;
                                }
                            }
                            while (cnt > 0) {
                                a[curIndex] = cur--;
                                curIndex -= k;
                                cnt--;
                            }
                        } else {
                            int curIndex = j - k;
                            long cur = prev + cnt;
                            while (cnt > 0) {
                                a[curIndex] = cur--;
                                curIndex -= k;
                                cnt--;
                            }
                        }
                    }
                    start = -1;
                    cnt = 0;
                    prev = a[j];
                } else {
                    if(start == -1) {
                        start = j;
                        cnt = 0;
                    }
                    cnt++;
                }
            }
        }
        for(int i = 0; i < n; i++) {
            out.print(a[i] + " ");
        }
    }

    private int getP() throws IOException {
        String s = readString();
        if(s.charAt(0) == '1') return 100;
        return Integer.parseInt(s.substring(2));
    }


    int index(char c) {
        if('a' <= c && c <= 'z') {
            return c - 'a';
        }
        return c - 'A' + 26;
    }

    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    int[] readArr(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = readInt();
        }
        return res;
    }

    long[] readArrL(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = readLong();
        }
        return res;
    }

    public static void main(String[] args) {
        new A().run();
    }

    public void run() {
        try {
            long t1 = System.currentTimeMillis();
            init();
            solve();
            out.close();
            long t2 = System.currentTimeMillis();
            System.err.println("Time = " + (t2 - t1));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }
}