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

public class E
{
    private static final int UNDEFINED = 1000000000 + 100000 + 13;
    public static void main(String[] args) throws Exception
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
        int n = Integer.parseInt(tokenizer.nextToken());
        int k = Integer.parseInt(tokenizer.nextToken());

        tokenizer = new StringTokenizer(reader.readLine());
        String [] array = new String[n];
        for(int i = 0 ; i < n ; i++)
            array[i] = tokenizer.nextToken();

        int [] build = new int[n];
        Arrays.fill(build, UNDEFINED);
        boolean good = true;

        for(int i = 0 ; i < k ; i++)
        {
            int count = 0;
            int lower = -UNDEFINED;
            int j;
            for(j = i ; j < n ; j += k)
                if(array[j].equals("?"))
                    count++;
                else
                {
                    build[j] = Integer.parseInt(array[j]);
                    if(count == 0 && j-k >= 0 && Integer.parseInt(array[j-k]) >= Integer.parseInt(array[j]))
                        good = false;

                    good &= solve(build, k, j-count*k, j-k, lower, Integer.parseInt(array[j]) - 1);
                    lower = Integer.parseInt(array[j])+1;
                    count = 0;
                }
            if(count > 0)
                good &= solve(build, k, j-count*k, j-k, lower, UNDEFINED);
        }

        PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));
        if(!good)
            writer.println("Incorrect sequence");
        else
        {
            for(int i = 0 ; i < build.length-1 ; i++)
                writer.print(build[i]+" ");
            writer.println(build[n-1]);
        }

        writer.flush();
        writer.close();
    }

    private static boolean solve(int[] build, int k, int lowerIdx, int higherIdx, int lower, int higher)
    {
        int need = (higherIdx - lowerIdx)/k + 1;
        if(need <= 0)
            return true;

        int have = higher - lower + 1;
        if(have < need)
            return false;

        if(lower >= 0)
        {
            int num = lower;
            for(int i = lowerIdx ; i <= higherIdx ; i+=k)
                build[i] = num++;

            return true;
        }
        else
        {
            if(higher < 0)
            {
                int num = higher;
                for(int i = higherIdx ; i >= lowerIdx ; i-=k)
                    build[i] = num--;
                return true;
            }
            else
            {
                int num = -need/2;
                if(num < lower)
                    num = lower;
                else if(num+need-1 > higher)
                    num = higher - (need-1);

                for(int i = lowerIdx ; i <= higherIdx ; i+=k)
                    build[i] = num++;

                return true;
            }
        }
    }


}