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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author ATailouloute
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        QuickScanner in = new QuickScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ArthurAndQuestions solver = new ArthurAndQuestions();
        solver.solve(1, in, out);
        out.close();
    }

    static class ArthurAndQuestions {
        int n;
        int k;
        int[] ans;
        boolean[] ok;

        public void solve(int testNumber, QuickScanner in, PrintWriter out) {
            n = in.nextInt();
            k = in.nextInt();
            ans = new int[n + 1];
            ok = new boolean[n + 1];
            for (int i = 1; i <= n; i++) {
                String next = in.nextString();
                if (!"?".equals(next)) {
                    ok[i] = true;
                    ans[i] = Integer.parseInt(next);
                }
            }
            for (int i = 1; i <= k; i++) {
                List<Integer> idxs = new ArrayList<>();
                idxs.add(i);
                for (int j = 1; j * k + i <= n; j++) idxs.add(j * k + i);
                if (idxs.size() == 1) break;
                //     out.println(idxs);
                int left = 0;
                int minLeft = Integer.MIN_VALUE;
                boolean process = false;
                for (int idx : idxs) if (!ok[idx]) process = true;
                if (!process) continue;
                while (left < idxs.size()) {
                    if (ok[idxs.get(left)]) {
                        minLeft = ans[idxs.get(left)] + 1;
                        left++;
                    } else {
                        int right = left;
                        int maxRight = Integer.MAX_VALUE;
                        for (int j = left + 1; j < idxs.size(); ++j) {
                            if (ok[idxs.get(j)]) {
                                maxRight = ans[idxs.get(j)] - 1;
                                break;
                            }
                            right = j;
                        }
                        update(idxs, left, right, minLeft, maxRight);
//                    out.printf("update(%d,%d, from=%d,to=%d)\n",left, right, minLeft,maxRight);
                        left = right + 1;
                    }
                }
                //break;
            }
            if (!good()) out.println("Incorrect sequence");
            else for (int i = 1; i <= n; i++) out.print(ans[i] + " ");
        }

        boolean good() {
            for (int i = 1; i <= k; i++) {
                int last = ans[i];
                for (int j = 1; j * k + i <= n; j++) {
                    if (ans[j * k + i] <= last) return false;
                    last = ans[j * k + i];
                }
            }
            return true;
        }

        void update(List<Integer> idx, int from, int to, int min, int max) {
            if (min >= 0) {
                for (int i = from, cur = min; i <= to; i++) {
                    ans[idx.get(i)] = cur++;
                }
                return;
            }
            if (max <= 0) {
                for (int i = to, cur = max; i >= from; i--) {
                    ans[idx.get(i)] = cur--;
                }
                return;
            }
            int nb = to - from + 1;
            int left;
            if (nb % 2 == 1) {
                left = Math.max(-nb / 2, min);
            } else {
                left = Math.max(-nb / 2, min);
            }
            for (int i = from, cur = left; i <= to; i++) {
                ans[idx.get(i)] = cur++;
            }
        }

    }

    static class QuickScanner {
        BufferedReader br;
        StringTokenizer st;
        InputStream is;

        public QuickScanner(InputStream stream) {
            is = stream;
            br = new BufferedReader(new InputStreamReader(stream), 32768);
        }

        public String nextToken() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public String nextString() {
            return nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(nextToken());
        }

    }
}

