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.*;
import java.lang.*;
import java.io.*;

public class Main
{
	public static void main (String[] args) throws IOException
	{
	    int sum = 0;
	    
		BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
		
		String first = r.readLine();
		String second = r.readLine();
		
		String[] temps = first.split(" ");
		
		int n = Integer.parseInt(temps[0]);
		int k = Integer.parseInt(temps[1]);
		
		temps = second.split(" ");
		
		int[] a = new int[n];
		
		int qPosition = -1;
		
		for (int i = 0; i < n; i++)
		{
		    if (temps[i].charAt(0) != '?')
		    {
		        a[i] = Integer.parseInt(temps[i]);
		    }
		    else
		    {
		        a[i] = 0;
		        qPosition = i;
		    }
		}
		
		int[] sums = new int[n - k + 1];
		
		for (int i = 0; i < k; i++)
		{
		    sum += a[i];
		}
		
		sums[0] = sum;
		
		for (int i = k; i < n; i++)
		{
		    sum = sum + a[i] - a[i - k];
		    
		    sums[i - k + 1] = sum;
		}
		
		boolean mismatch = false;
		
		for (int i = 0; i < sums.length - 1; i++)
		{
		    if (sums[i] >= sums[i + 1] && (i != 0 || qPosition != 0) && (i != (n - k) || qPosition != (n - 1)) && k > 1)
		    {
		        System.out.println("Incorrect sequence");
		        return;
		    }
		    else if (sums[i] >= sums[i + 1])
		    {
		        mismatch = true;
		    }
		}
		
		if (mismatch)
		{
		    if (qPosition == 0)
		    {
		        a[0] = sums[0] - sums[1] - 1;
		    }
		    else if (qPosition == (n - 1))
		    {
		        a[n - 1] = sums[n - 2] - sums[n - 1] + 1;
		    }
		    else if (sums[qPosition + 1] - sums[qPosition - 1] > 1)
		    {
		        int left = a[qPosition - 1] + 1;
		        int right = a[qPosition + 1] - 1;
		        
		        int absLeft = (left < 0) ? -left : left;
		        int absright = (right < 0) ? -right : right;
		        
		        a[qPosition] = (absLeft < absright) ? left : right;
		    }
		    else
		    {
		        System.out.println("Incorrect sequence");
		        return;
		    }
		}
		
		for (int i = 0; i < n - 1; i++)
		{
		    System.out.print(a[i] + " ");
		}
		
		System.out.println(a[n - 1]);
	}
}
