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 {

	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;
	long[] sum;
	static String NO="Incorrect sequence";
	boolean[] visited;
	boolean[] modificable;
	boolean[] plus;
	boolean[] minus;



	boolean align(int i,boolean flag){
		log("Align i:"+i+" flag:"+flag);
		if (i<N-K+1){	
			// si déjà ok
			long diff=a[i]-a[i+K];
			if (diff<0)
				return true;

			//sinon différence
			long delta=1+diff;

			// on a maintenant 2 options
			// soit on baisse a[i], mais attention on destabilise eventuellement la position i-k+1 par rapport à i-k
			// soit on augmente a[i+K], et on destabilise potentiellement la position i+k par rapport à i+k+1
			// approche on essaie d'abord de modifier vers l'avant
			// et si pas possible, on backtracke

			if (!flag){

				if (modificable[i] && !plus[i]){
					log("Case 1: delta:"+delta);
					a[i]-=delta;
					minus[i]=true;
					if (i-K>=0)
						return align(i-K,false);
					return true;
				}


				if ((i+K<N) && modificable[i+K] && !minus[i+K]){
					log("Case 2: delta:"+delta);

					a[i+K]+=delta;
					plus[i+K]=true;
					if (i+K<N-K+1)
						return align(i+K,true);
					return true;
				}
			} else {
				if ((i+K<N) && modificable[i+K] && !minus[i+K]){
					log("Case 3: delta:"+delta);

					a[i+K]+=delta;
					plus[i+K]=true;
					if (i+K<N-K+1)
						return align(i+K,true);
					return true;
				}

				if (modificable[i] && !plus[i]){
					log("Case 4: delta:"+delta);

					a[i]-=delta;
					minus[i]=true;
					if (i-K>=0)
						return align(i-K,false);
					return true;
				}
			}
			return false;
		}
		return true;
	}

	void tryUpdate(int i){

		/*
		long delta=Long.MAX_VALUE;
		if (a[i]<0){
			if (i+1<N){
				delta=sum[]
			}
		}
		 */
	}



	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-1;
			long lastVal=Integer.MIN_VALUE;
			log("Entering loop");
			while (x<N){
				log("x:"+x+" N:"+N);
				while (x<N && modificable[x]){
					log("Skipping modificable");
					x+=K;
				}
				if (x<N){
					log("Found not modificable x:"+x);
					int dist=(x-last)/K;
					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;
								lo=0;
								hi=0;
								while (cnt<dist-1){
									if (lo-1>min){
										lo--;
										cnt++;
									}
									if (cnt<dist-1){
										if (hi+1<max) {
											hi++;
											cnt++;
										} } } } }
						log("lastVal:"+lastVal+" a[x]:"+a[x]+" hi:"+hi+" lo:"+lo);
						for (int u=0;u<dist-1;u++){
							a[last+1+u]=lo+u;
						}
						lastVal=a[x];
						last=x;
					}
					x+=K;
				}
			}
		}
		for (int i=0;i<N;i++)
			outputWln(a[i]+" ");
		output("");
	}


	void solve(){
		sum=new long[N+1-K];
		sum[0]=0;
		for (int i=0;i<K;i++){
			sum[0]+=a[i];
		}
		log("sum[0]:"+sum[0]);
		for (int i=1;i<N+1-K;i++){
			sum[i]=sum[i-1];
			sum[i]-=a[i-1];
			sum[i]+=a[i+K-1];
			log("sum[i]:"+sum[i]);
		}

		// première passe, on aligne comme on peut
		for (int i=0;i<N-K;i++){
			minus=new boolean[N];
			plus=new boolean[N];

			if (!align(i,false)){
				output(NO);
				return;
			}
		}
		for (int i=0;i<N;i++){
			if (modificable[i]){
				if (a[i]!=0)
					tryUpdate(i);
			}
		}

		for (int i=0;i<N;i++)
			logWln(a[i]+" ");
		log("");
		output("yes");
	}

	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 J=new CF_ArthurQuestions();


		J.process();


	}


}