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.util.Scanner;

public class Main {
	static Scanner sc;
	static int n,k;
	static int[] a;
	static int[] b;
	public static void main(String[] args){
		sc=new Scanner(System.in);
		n=sc.nextInt();
		k=sc.nextInt();
		a=new int[n+1];
		b=new int[n+1];
		sc.nextLine();
		String temp=sc.nextLine();
		String[] temp2=temp.split(" ");
		for (int i=1;i<=n;i++){
			if (temp2[i-1].equals("?")){
				a[i]=Integer.MIN_VALUE;
			}else{
				a[i]=Integer.parseInt(temp2[i-1]);
			}
		}
		if (!work()){
			System.out.println("Incorrect sequence");
		}else{
			if (a[1]==Integer.MIN_VALUE){
				System.out.print(b[1]);
			}else{
				System.out.print(a[1]);
			}
			for (int i=2;i<=n;i++){
				if (a[i]==Integer.MIN_VALUE){
					System.out.print(" "+b[i]);
				}else{
					System.out.print(" "+a[i]);
				}
			}
			System.out.println();
		}		
	}
	private static boolean work() {
		for (int i=1;i<=n;i++){
			if (a[i]==Integer.MIN_VALUE){
				if (i-k>=1){
					continue;
				}else{
					int start=Integer.MIN_VALUE;
					int temp=i+k;
					int end=Integer.MAX_VALUE;
					while(temp<=n){
						if (a[temp]==Integer.MIN_VALUE){
							temp+=k;
						}else{
							end=a[temp];							
							break;
						}
					}					
					temp-=k;					
					if (!fill(start,end,i,temp)){
						return false;
					}
				}
			}else{
				if ((i+k<=n)&&a[i+k]==Integer.MIN_VALUE){
					int start=a[i];
					int temp=i+k;
					int end=Integer.MAX_VALUE;
					while(temp<=n){
						if (a[temp]==Integer.MIN_VALUE){
							temp+=k;
						}else{
							end=a[temp];							
							break;
						}
					}					
					temp-=k;					
					if (!fill(start,end,i+k,temp)){
						return false;
					}
				}
				if ((i+k<=n)&&(a[i+k]!=Integer.MIN_VALUE)){
					if (a[i]>=a[i+k]){
						return false;
					}
				}
			}
		}
		return true;
	}
	private static boolean fill(int start, int end, int x, int y) {
		long ava=((long)end)-start-1;
		int need=(y-x)/k+1;
		if (need>ava){
			return false;
		}
		if ((start>=0)||(need==ava)){
			int value=start+1;
			for (int i=x;i<=y;i=i+k){
				b[i]=value;
				value++;
			}
			return true;
		}
		if (end<=0){
			int value=end-1;
			for (int i=y;i>=x;i=i-k){
				b[i]=value;
				value--;
			}
			return true;
		}
		int value=-need/2;
		int endValue=value+need-1;
		if (value<start+1){
			value=start+1;
		}
		if (endValue>=end){
			int temp=endValue-end+1;
			value=value-temp;
		}
		for (int i=x;i<=y;i=i+k){
			b[i]=value;
			value++;
		}
		return true;
	}
}
