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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class E implements Runnable {

    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    final boolean OJ = System.getProperty("ONLINE_JUDGE") != null;

    void init() throws FileNotFoundException {
        if (OJ) {
            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");
        }
    }

    public static void main(String[] args) {
        new Thread(null, new E(), "", 128 * (1L << 20)).start();
    }

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

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

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

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

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

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    long memoryTotal, memoryFree;

    void memory() {
        memoryFree = Runtime.getRuntime().freeMemory();
        System.err.println("Memory = " + ((memoryTotal - memoryFree) >> 10)
                + " KB");
    }

    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            memoryTotal = Runtime.getRuntime().freeMemory();
            init();
            solve();
            out.flush();
            out.close();
            time();
            memory();

        } catch (IOException e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    void exit() {
        out.println("Incorrect sequence");
        out.flush();
        out.close();
        System.exit(0);
    }

    void solve() throws IOException {

        int n = readInt();
        int k = readInt();

        List<Long>[] list = new List[k];

        int INF = Integer.MAX_VALUE;
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            String s = readString();
            if ("?".equals(s)) {
                a[i] = INF;
            } else {
                a[i] = Integer.parseInt(s);
            }
        }

        for (int i = 0; i < k; i++) {
            list[i] = new ArrayList<Long>();
            list[i].add(-1l * INF);
            for (int j = i; j < n; j += k) {
                list[i].add(1l * a[j]);
            }
            list[i].add(1l * INF);
        }

        for (int i = 0; i < k; i++) {
            List<Long> curList = list[i];
            List<Long> newList = new ArrayList<Long>();
            int left = 0;
            long valLeft = curList.get(0);
            for (int j = 1; j < curList.size(); j++) {
                long cur = curList.get(j);
                if (cur == INF && j != curList.size() - 1)
                    continue;
                int right = j;
                long valRight = cur;
                if (valRight <= valLeft) {
                    exit();
                }
                if (valLeft != -INF) {
                    newList.add(valLeft);
                }
                int innerLength = (right - left - 1);
                if (valLeft <= 0 && valRight <= 0) {
                    for (int l = 0; l < innerLength; l++) {
                        newList.add(valRight - (innerLength - l));
                    }
                    if (valLeft >= valRight - innerLength) {
                        exit();
                    }
                } else {
                    if (valLeft >= 0 && valRight >= 0) {
                        for (int l = 0; l < innerLength; l++) {
                            newList.add(valLeft + l + 1);
                        }
                        if (valRight <= valLeft + innerLength) {
                            exit();
                        }
                    } else {
                        long preLeftValue = valRight - innerLength;
                        long preRightValue = valLeft + innerLength;
                        if (!(preLeftValue > valLeft || preRightValue < valRight)) {
                            exit();
                        }
                        long mid = (1l * preRightValue + valLeft) / 2;
                        for (int l = 0; l < innerLength; l++) {
                            newList.add((1l * valLeft + l + 1 - mid));
                        }
                    }
                }
                // if (valRight != INF) {
                // newList.add(valRight);
                // }
                valLeft = valRight;
                left = right;
            }
            list[i] = newList;
        }
        for (int i = 0; i < list[0].size(); i++) {
            for (int j = 0; j < k; j++) {
                if (i < list[j].size()) {
                    out.print(list[j].get(i) + " ");
                }
            }
        }
    }
}