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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Created by liqiu on 2/24/15.
 */
public class E {
    static long inf = (long) 1e10;
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        int k = cin.nextInt();
        long[] lower = new long[n];
        long[] up = new long[n];
        Arrays.fill(lower, -inf);
        Arrays.fill(up, inf);
        long[] a = new long[n];
        for (int i = 0; i < n; ++i) {
            String s = cin.next();
            if (s.equals("?")) a[i] = -inf;
            else a[i] = Long.parseLong(s);
        }
        for(int rem = 0; rem < k; ++rem){
            ArrayList<Integer> pos = new ArrayList<Integer>();
            long low = -inf; long high = inf;
            for(int i = rem; i < n; i += k){
                if( a[i] == -inf ){
                    pos.add(i);
                }else {
                    high = a[i] - 1;
                    int cnt = pos.size();
                    if (high - low + 1 < cnt) {
                        System.out.println("Incorrect sequence");
                        return;
                    }
                    if (cnt > 0) {
                        long lf = low + cnt / 2;
                        long rt = high - (cnt - 1 - cnt / 2);
                        long base = 0;
                        if (lf > 0) base = lf;
                        else if (rt < 0) base = rt;
                        else base = 0;
                        for (int j = 0; j < cnt; ++j) a[pos.get(j)] = j - cnt / 2 + base;
                        pos.clear();
                    }
                    low = a[i] + 1;
                    high = inf;
                }
            }
            //check last one
            int cnt = pos.size();
            if( high  - low + 1 < cnt ){
                System.out.println("Incorrect sequence");
                return;
            }
            if( cnt > 0 ) {
//                System.out.println(pos.size() + "--" + rem);
                long lf = low + cnt / 2;
                long rt = high - (cnt - 1 - cnt/2);
                long base = 0;
                if( lf > 0 ) base = lf;
                else if(rt < 0 ) base = rt;
                else base = 0;
                for(int j = 0; j < cnt; ++j) a[ pos.get(j) ] = j - cnt / 2 + base;
                pos.clear();
            }
        }
        for(int i = 0; i < n; ++i)
            System.out.print(a[i] + " ");
        System.out.println();
    }
}
