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;


public class E {
	static boolean DEBUG = false; 
	static InputStreamReader isr = new InputStreamReader(System.in);
	static BufferedReader br = new BufferedReader(isr);

	static int[] readIntArray() throws IOException {
		String[] v = br.readLine().split(" ");
		int[] ans = new int[v.length];

		for (int i = 0; i < ans.length; i++) {
			ans[i] = Integer.valueOf(v[i]);
		}

		return ans;
	}

	static int n,k;
	static int[] numbers;
	static boolean[] isSpecified;
	static String incorrect = "Incorrect sequence";
	
	public static void main (String[] args) throws IOException {
		
		if (DEBUG) {
			int[] ns = new int[] { 3, 5, 5, 10, 5 };
			int[] ks = new int[] { 2, 1, 3, 2, 3 };
			String[] seqs = new String[] { 
					"? 1 2", 
					"-10 -9 ? -7 -6", 
					"4 6 7 2 9",
					"? ? ? ? ? ? ? ? ? ?",
					"1 2 4 3 ?"
					};
			for (int i = 0; i < seqs.length; i++) {
				n = ns[i];
				k = ks[i];
				parseNumbers(seqs[i]);
				solve();
			}
		} else {
			int[] l = readIntArray();
			n = l[0];
			k = l[1];
			parseNumbers(br.readLine());
			solve();
		}
	}
	
	static void parseNumbers(String seq) {
		String[] vals = seq.split(" ");
		isSpecified = new boolean[vals.length];
		numbers = new int[vals.length];
		for (int i = 0; i < vals.length; i++) {
			isSpecified[i] = vals[i].charAt(0) != '?';
			if(isSpecified[i]) {
				numbers[i] = Integer.valueOf(vals[i]);
			}
		}
	}
	
	static void solve() {
		for (int i = 0; i < k; i++) {
			int lastInd = -1;
			int unspecifiedCnt = 0;
			
			for (int j = i; j < numbers.length; j+=k) {
				if (isSpecified[j]) {
					int current = numbers[j];
					if (lastInd == -1) {
						int shouldBe = unspecifiedCnt / 2;
						int mustBe = Math.min(shouldBe, current-1);
						for (int m = i-k; m >= 0; m-=k, mustBe--) {
							numbers[m] = mustBe;
							isSpecified[m] = true;
						}
					} else {
						if (numbers[lastInd] >= numbers[j]) {
							System.out.println(incorrect);
							return;
						}
						int optimalMin = Math.max(numbers[lastInd] + 1, -unspecifiedCnt/2);
						optimalMin = Math.min(numbers[j] - unspecifiedCnt, optimalMin);
						int space = numbers[j] - numbers[lastInd];
						if (unspecifiedCnt > space) {
							System.out.println(incorrect);
							return;
						}
						int mustBe = optimalMin;
						for (int m = lastInd+k; m < j; m+=k, mustBe++) {
							numbers[m] = mustBe;
							isSpecified[m] = true;
						}
					}
					
					unspecifiedCnt = 0;
					lastInd = j;
				} else {
					unspecifiedCnt++;
				}
			}
			
			int lng = unspecifiedCnt;
			int startInd = i;
			int optimalMin = Integer.MIN_VALUE;
			if (lastInd != -1) {
				optimalMin = numbers[lastInd] + 1;
				startInd = lastInd+k;
			}
			
			optimalMin = Math.max(optimalMin, -lng/2); 
			for (int j = startInd; j < numbers.length; j+=k) {
				numbers[j] = optimalMin++;
				isSpecified[j] = true;
			}
		}
		
		StringBuilder ans = new StringBuilder();
		for (int i = 0; i < numbers.length; i++) {
			if (ans.length() > 0) {
				ans.append(' ');
			} 
			
			ans.append(numbers[i]);
		}
		System.out.println(ans.toString());
	}
	
}







