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.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

import java.util.Arrays;
import java.util.StringTokenizer;



public final class CF_ArthurQuestions_v2 {

	void log(int[] X){
		int L=X.length;
		for (int i=0;i<L;i++){
			logWln(X[i]+" ");
		}
		log("");
	}


	void log(long[] X){
		int L=X.length;
		for (int i=0;i<L;i++){
			logWln(X[i]+" ");
		}
		log("");
	}
	void log(Object[] X){
		int L=X.length;
		for (int i=0;i<L;i++){
			logWln(X[i]+" ");
		}
		log("");
	}


	void log(Object o){
		logWln(o+"\n");
	}

	void logWln(Object o){
	//System.out.print(o);
	//	outputWln(o);

	}
	void info(Object o){
		System.out.println(o);
		//output(o);
	}

	void output(Object o){

		outputWln(""+o+"\n");

	}

	void outputWln(Object o){
		// System.out.print(o);

		try {
			out.write(""+ o);
		} catch (Exception e) {

		}
	}


	String next(){
		while (st== null|| !st.hasMoreTokens()) {
			try {
				st=new StringTokenizer(in.readLine());
			} catch (Exception e) {
			}
		}
		return st.nextToken();
	}

	String nextLine(){
		try {
			return in.readLine();
		} catch (Exception e) {
		}
		return null;
	}

	int nextInt(){
		return Integer.parseInt(next());
	}


	long nextLong(){
		return Long.parseLong(next());


	}


	// Global vars
	StringTokenizer st;
	BufferedReader in;
	BufferedWriter out;
	int N,K;
	long[] a;
	static String NO="Incorrect sequence";
	boolean[] modificable;


	void check(){
		for (int i=0;i<K;i++){
			int x=i;
			if (x+K<N && a[x+K]<=a[x]){
				output("Error");
				return;
			}
			x+=K;
		}
	}

	void solve2(){
		// on a diff[i]=sum[i]-sum[i+1]=a[i]-a[i-k]
		// il faut que les sum soient <
		log("==========================Solving 2");
		for (int i=0;i<K;i++){
			int x=i;
			int last=i-K;
			long lastVal=Integer.MIN_VALUE;
			log("Entering loop");
			boolean endedWell=false;
			int found=0;
			while (x<N){
				log("x:"+x+" N:"+N);
				while (x<N && modificable[x]){
					log("Skipping modificable:"+x);
					x+=K;
					endedWell=false;
				}
				int dist=(x-last)/K;
				
				if (x<N){
					endedWell=true;
					found++;
					log("Found not modificable x:"+x);
					if (dist==1){
						if (a[x]<=lastVal){
							output(NO);
							return;
						}
					}
					else {
						log("Dist > 1");
						int target=(int)a[x];
						if (lastVal!=Integer.MIN_VALUE){
							long delta=a[x]-lastVal;
							if (delta<dist){
								output(NO);
								return;
							}
						}else {
							if (a[x]<=0)
								lastVal=a[x]-dist;
							else {
								lastVal=Math.min(-a[x],-dist);
							}
						}
						long lo,hi;
						long min=lastVal+1;
						long max=a[x]-1;
						if (max>=0 && min>=0){
							lo=min;
							hi=min+(dist-2);
						} else {
							if (max<=0){
								hi=max;
								lo=max-(dist-2);
							} else {
								int cnt=1;
								log("Case special");
								lo=0;
								hi=0;
								while (cnt<dist-1){
									if (lo>min){
										lo--;
										cnt++;
									}
									if (cnt<dist-1){
										if (hi<max) {
											hi++;
											cnt++;
										} } } } }
						log("lastVal:"+lastVal+" a[x]:"+a[x]+" hi:"+hi+" lo:"+lo+" last:"+last);
						for (int u=last+K;u<x;u+=K){
							a[u]=lo++;
						}
					
					}
					lastVal=a[x];
					last=x;
					log("last:"+last);
					x+=K;
				}
				if (!endedWell && x>=N){
					log("Not ended well. Need to complete");
					if (found==0){
						log("Everything is ?");
						dist=(x-i)/K;
						int base=-dist/2;
						for (int y=i;y<x;y+=K){
							a[y]=base;
							base++;
						}
					} else {
						log("Completing from lastVal:"+lastVal);
						if (lastVal>=0){
							log("Case A");
							long base=lastVal+1;
							for (int y=last+K;y<x;y+=K){
								a[y]=base++;
							}
						} else {
							log("Case B");
							long lo=0;
							long hi=0;
							int y=last+K;
							long min=lastVal+1;
							while (y+K<x){
								if (lo>min){
									lo--;
									log("lo:"+lo);
									y+=K;
								}
								if (y<x){
										hi++;
										log("hi:"+hi);
										y+=K;
								}
							}
							for (y=last+K;y<x;y+=K){
								a[y]=lo++;
							}
							
							
						}
						}
				}
			}
		}
		for (int i=0;i<N;i++)
			outputWln(a[i]+" ");
		output("");
		//check();
		
	}


	

	void process() throws Exception {



		out = new BufferedWriter(new OutputStreamWriter(System.out));
		in=new BufferedReader(new InputStreamReader(System.in));


		N=nextInt();
		K=nextInt();
		a=new long[N];
		modificable=new boolean[N];
		for (int i=0;i<N;i++){
			String s=next();
			if (s.equals("?")){
				a[i]=0;
				modificable[i]=true;
			}
			else
				a[i]=Integer.parseInt(s);
		}

		solve2();

		try {
			out.close();
		}
		catch (Exception e){}
	}



	public static void main(String[] args) throws Exception {
		CF_ArthurQuestions_v2 J=new CF_ArthurQuestions_v2();


		J.process();


	}


}