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.*;

public class E {
    public static void main(String[] args) throws Exception {

        new E().solve();
    }

    int n;
    long[] min, max;
    int[] next;
    void solve() throws IOException {
        FastScanner in = new FastScanner(System.in);

        String NG = "Incorrect sequence";
        n = in.nextInt();
        int k = in.nextInt();
        boolean[] isQ = new boolean[n];
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            String s = in.next();
            if (s.charAt(0) == '?') {
                isQ[i] = true;
            } else {
                a[i] = Integer.parseInt(s);
            }
        }

        long INF = Long.MAX_VALUE / 2;
        min = new long[n];
        max = new long[n];
        Arrays.fill(min, -INF);
        Arrays.fill(max, INF);
        next = new int[n];
        Arrays.fill(next, -1);

        for (int si = 0; si + k < n; si++) {
            int ei = si + k;
            if (!isQ[si] && !isQ[ei]) {
                if (a[si] >= a[ei]) {
                    // NG!!!
                    System.out.println(NG);
                    return;
                }

            } else if (!isQ[ei]) {
                // si
                max[si] = a[ei] - 1;

            } else if (!isQ[si]) {
                // ei
                min[ei] = a[si] + 1;

            } else {
                // si, ei
                next[si] = ei;
                min[ei] = min[si] + 1;
            }
        }

        long[] ret = new long[n];
        boolean[] done = new boolean[n];
        for (int i = 0; i < n; i++) {
            if (!isQ[i]) {
                done[i] = true;
                ret[i] = a[i];
            } else if (done[i]) {
                //
            } else if (next[i] == -1) {
                if (min[i] > max[i]) {
                    System.out.println(NG);
                    return;
                }
                if (min[i] <= 0 && 0 <= max[i]) {
                    ret[i] = 0;
                } else if (max[i] < 0) {
                    ret[i] = max[i];
                } else {
                    ret[i] = min[i];
                }
            } else {
                if (!calc(i, ret, done)) {
                    System.out.println(NG);
                    return;
                }
            }
        }

        StringBuilder sb = new StringBuilder();
        sb.append(ret[0]);
        for (int i = 1; i < n; i++) {
            sb.append(" " + ret[i]);
        }
        System.out.println(sb);

    }

    ArrayList<Integer> ilist = new ArrayList<Integer>();
    boolean calc(int i, long[] ret, boolean[] done) {
        while (ilist.size() < n) {
            ilist.add(0);
        }
        int L = 0;
        ilist.set(L++, i);
        while (next[i] != -1) {
            i = next[i];
            ilist.set(L++, i);
        }
        int iLast = ilist.get(L - 1);
        int i2L = ilist.get(L / 2);
        if (min[iLast] > max[iLast]) {
            return false;
        }

        long up = 0L;
        if (min[i2L] < 0) {
            up = Math.min(-min[i2L], max[iLast] - min[iLast]);
        }

        for (int jj = 0; jj < L; jj++) {
            int idx = ilist.get(jj);
            ret[idx] = min[idx] + up;
            done[idx] = true;
        }
        return true;
    }
    class FastScanner {

        private InputStream _stream;
        private byte[] _buf = new byte[1024];
        private int _curChar;
        private int _numChars;
        private StringBuilder _sb = new StringBuilder();

        FastScanner(InputStream stream) {
            this._stream = stream;
        }

        public int read() {
            if (_numChars == -1) throw new InputMismatchException();
            if (_curChar >= _numChars) {
                _curChar = 0;
                try {
                    _numChars = _stream.read(_buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (_numChars <= 0) return -1;
            }
            return _buf[_curChar++];
        }

        public String next() {
            int c = read();
            while (isWhitespace(c)) {
                c = read();
            }
            _sb.setLength(0);
            do {
                _sb.appendCodePoint(c);
                c = read();
            } while (!isWhitespace(c));
            return _sb.toString();
        }

        public int nextInt() {
            return (int) nextLong();
        }
        public long nextLong() {
            int c = read();
            while (isWhitespace(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isWhitespace(c));
            return res * sgn;
        }

        public boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
    }

}

//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
