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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;

/*

3 2
? 1 2

5 1
-10 -9 ? -7 -6

5 3
4 6 7 2 9

5 3
? ? ? ? ?

5 2
? ? ? 4 5

5 2
? ? ? -3 -2

5 2
1 2 ? ? ? 

6 1
-6 ? ? ? ? 1

 */

public class e {
	
	static int n;
	static int k;
	static int[] seq;
	static boolean[] q;
	
	static PrintWriter out;
	public static void main(String[] args) 
	{
		FastScanner in = new FastScanner();
		out = new PrintWriter(System.out);

		n = in.nextInt();
		k = in.nextInt();
		
		seq = new int[n];
		q = new boolean[n];
		
		for(int curr = 0; curr < n; ++curr)
		{
			String next = in.next();
			if(next.startsWith("?"))
			{
				q[curr] = true;
			}
			else
			{
				seq[curr] = Integer.parseInt(next);
			}
		}
		
		boolean valid = true;
		
		for(int currSeq = 0; currSeq < k && valid; ++currSeq)
		{
			int start = currSeq;
			int end;
			for(end = start; end < n; end += k)
			{
				if(q[end])
					continue;
				
				if(end - start == k && !q[end] && !q[start])
				{	
					start = end;
					continue;
				}
				
				if(q[start])
				{
					//System.out.println(start +" "+end);
					fill(start, end -k, Math.min(seq[end] - (end - start)/k, -(end - start)/(2*k)));
				}
				else if (start != end)
				{
					//System.out.println("Part of chain: "+start +" " +end +" " +0);
					
					if((end - start - k)/k > (seq[end] - seq[start] - 1))
					{
						valid = false;
						break;
					}
					
					int val = 0;
					if(seq[start] >= 0 && seq[end] >= 0)
						val = seq[start] +1;
					else if (seq[start] <= 0 && seq[end] <= 0)
						val = seq[end] - (end - start)/k +1;
					else
					{
						int num = (end - start)/k -1;
						val = -num/2;
						if(seq[start] >= val || seq[end] < val+num)
						{
							//System.out.println(num +" " +val);
							int v1 = seq[start]+1;
							int v2 = seq[end] - num;
							if(Math.abs(v1) > Math.abs(v2))
							{
								val = Math.max(v1, v2);
							}
							else
							{
								val = Math.min(v1, v2);
							}
						}
					}
					
					fill(start+k, end -k, val);
				}
				
				start = end;
			}
			
			//End of the sequence is a question mark
			if(valid && q[end-k])
			{
				//Entire chain consists of question marks
				if(start == currSeq && q[start])
				{
					//System.out.println("Entire Chain: "+start +" " +end);
					fill(start, end -k, -(end - start)/(2*k));
				}
				//Just the end
				else
				{		
					//System.out.println("End of Chain: " +start +" " +end);
					fill(start+k, end-k, Math.max(seq[start]+1, -(end-k-start)/(2*k)));
				}
			}
		}
		
		
		//check
		for(int curr = 0; curr +k < n && valid; ++curr)
		{
			valid = seq[curr] < seq[curr+k];
		}
		
		if(valid)
		{
			for(int curr = 0; curr < n; ++curr)
			{
				out.print(seq[curr] +" ");
			}
			out.println();
		}
		else
		{
			out.println("Incorrect sequence");
			
//			for(int curr = 0; curr < n; ++curr)
//			{
//				out.print(seq[curr] +" ");
//			}
//			out.println();
		}
		
		out.close();
	}
	
	static void fill(int start, int end, int val)
	{
		for(int curr = start; curr <= end; curr += k)
		{
			seq[curr] = val;
			++val;
		}
	}

	static class FastScanner{
		   private InputStream stream;
		   private byte[] buf = new byte[1024];
		   private int curChar;
		   private int numChars;

		   public FastScanner()
		   {
		      stream = System.in;
		   }

		   int read()
		   {
		      if (numChars == -1)
		         throw new InputMismatchException();
		      if (curChar >= numChars){
		         curChar = 0;
		         try{
		            numChars = stream.read(buf);
		         } catch (IOException e) {
		            throw new InputMismatchException();
		         }
		         if (numChars <= 0)
		            return -1;
		      }
		      return buf[curChar++];
		   }

		   boolean isSpaceChar(int c)
		   {
		      return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
		   }
		   
		   boolean isEndline(int c)
		   {
		      return c=='\n'||c=='\r'||c==-1;
		   }

		   int nextInt()
		   {
		      return Integer.parseInt(next());
		   }
		   
		   long nextLong()
		   {
		      return Long.parseLong(next());
		   }

		   double nextDouble()
		   {
		      return Double.parseDouble(next());
		   }

		   String next(){
		      int c = read();
		      while (isSpaceChar(c))
		         c = read();
		      StringBuilder res = new StringBuilder();
		      do{
		         res.appendCodePoint(c);
		         c = read();
		      }while(!isSpaceChar(c));
		      return res.toString();
		   }
		   
		   String nextLine(){
		      int c = read();
		      while (isEndline(c))
		         c = read();
		      StringBuilder res = new StringBuilder();
		      do{
		         res.appendCodePoint(c);
		         c = read();
		      }while(!isEndline(c));
		      return res.toString();
		   }
		}
}
