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 Div2_293_E{
	static int[] seq;
	static final int MIN = -1000000010;
	public static void main(String[] args) throws IOException{
		BufferedInputStream bis = new BufferedInputStream(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(bis));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		seq = new int[n];
		boolean hasSolution = true;
		st = new StringTokenizer(br.readLine());
		for(int i = 0;i < n;i++) {
			String curr = st.nextToken();
			if(curr.charAt(0)!='?') {
				seq[i] = Integer.parseInt(curr);
			} else
				seq[i] = MIN; 
		}
		int upInd = Math.min(n-k, k), j;
		for(int i = 0;i < upInd && hasSolution;i++) {
			int end = (n-i)/k;
			if((n-i)%k==0)
				end--;
			for(j = i;j < seq.length && seq[j]==MIN;j += k);
			if(j < seq.length) {
				if(j-k >= 0 && hasSolution)
					hasSolution &= fillBelow(j-k, seq[j], k);
				if(j+k < seq.length && hasSolution)
					hasSolution &= fillAbove(j+k, seq[j], k);
			} else {
				seq[i] = -1*(int)Math.floor(end/2.0);
				hasSolution &= fillAbove(i+k, seq[i], k);
			}
		}
		if(!hasSolution)
			System.out.println("Incorrect sequence");
		else {
			System.out.print(seq[0]);
			for(int i = 1;i < seq.length;i++)
				System.out.print(" "+seq[i]);
			System.out.println();
		}
	}
	public static boolean fillAbove(int ind, int val, int k) {
		if(ind >= seq.length)return true;
		if(seq[ind] == MIN) {
			if(ind+k < seq.length && seq[ind+k] != MIN) {
				seq[ind] = select(val+1, seq[ind+k]-1);
				if(seq[ind+k]<=seq[ind]) return false;
				return fillAbove(ind+k, seq[ind], k);
			} else
				seq[ind] = select(val+1, Integer.MAX_VALUE);
			return fillAbove(ind+k, seq[ind], k);
		} else if(seq[ind] <= val)
			return false;
		else
			return fillAbove(ind+k, seq[ind], k);
	}
	public static int select(int min, int max) {
		if(min >= 0) return min;
		if(max <= 0)return max;
		return 0;
	}
	public static boolean fillBelow(int ind, int val, int k) {
		if(ind < 0)return true;
		if(seq[ind] == MIN) {
			if(ind-k >= 0 && seq[ind-k] != MIN) {
				seq[ind] = select(seq[ind-k]+1, val-1);
				if(seq[ind-k]>=seq[ind])return false;
				return fillBelow(ind-k, seq[ind], k);
			}else
				seq[ind] = select(MIN, val-1);
			return fillBelow(ind-k, seq[ind], k);
		}else if(seq[ind] >= val)
			return false;
		else
			return fillBelow(ind-k, seq[ind], k);
		
	}
}
