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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;


public class E {	
	BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter out;

    long UNDEF = Long.MAX_VALUE;
	public void solve() throws IOException {				
		int N = nextInt();
        int K = nextInt();
        String[] SS = reader.readLine().split(" ");
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            if (SS[i].equals("?")) {
                A[i] = UNDEF;
            } else {
                A[i] = Integer.parseInt(SS[i]);
            }
        }

        for (int i = 0; i < K; i++) {
            ArrayList<Long> ns = new ArrayList<Long>();
            for (int j = i; j < N; j+=K) {
                ns.add(A[j]);
            }
            long[] B = new long[ns.size()];
            for (int j = 0; j < ns.size(); j++) {
                B[j] = ns.get(j);
            }
            boolean result = build(B);
            if (!result) {
                out.println("Incorrect sequence");
                return;
            } else {
                int k = 0;
                for (int j = i; j < N; j+=K) {
                    A[j] = B[k++];
                }
            }
        }

        for (int i = 0; i < N; i++) {
            out.print(A[i] + " ");
        }
        out.println();
	}

    public boolean build(long[] A) {
        int N = A.length;
        int cur1 = 0;

//        System.out.println(Arrays.toString(A));
        while (cur1 < N) {
            while (cur1 < N && A[cur1] != UNDEF) {
                cur1++;
            }

            if (cur1 == N) break;

            int cur2 = cur1;
            while (cur2 < N-1 && A[cur2+1] == UNDEF) {
                cur2++;
            }

//            System.out.println(cur1 + ", " + cur2);

            int cnt = cur2 - cur1 + 1;
            long min = cur1 > 0? A[cur1-1]+1: Long.MIN_VALUE/3;
            long max = cur2 < N-1? A[cur2+1]-1: Long.MAX_VALUE/3;

            if (max - min + 1 < cnt) {
                return false;
            }

            if (min >= 0) {
                for (int j = cur1; j <= cur2; j++) {
                    A[j] = min + (j - cur1);
                }
            } else if (max <= 0) {
                for (int j = cur2; j >= cur1; j--) {
                    A[j] = max + (j - cur2);
                }
            } else {
                if (min >= -cnt/2) {
                    for (int j = cur1; j <= cur2; j++) {
                        A[j] = min + (j - cur1);
                    }
                } else if (max <= cnt/2) {
                    for (int j = cur2; j >= cur1; j--) {
                        A[j] = max + (j - cur2);
                    }
                } else {
                    for (int j = cur1; j <= cur2; j++) {
                        A[j] = -cnt/2 + (j - cur1);
                    }
                }
            }

            cur1 = cur2 + 1;
        }

        for (int i = 0; i < N-1; i++) {
            if (A[i] >= A[i+1]) return false;
        }

        return true;
    }
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new E().run();
	}
	
	public void run() {
        try {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
            out = new PrintWriter(System.out);
            solve();
            reader.close();
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

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

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

}
