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.*;

public class CF518E {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k1 = in.nextInt();

        long[] v = new long[(int)n];

        for (int i = 0; i < n; i++) {
            String str = in.next();
            if (str.equals("?")) v[i] = Long.MIN_VALUE;
            else v[i] = Long.parseLong(str);
        }

        boolean result = false;
        for (int i = 1; i < n && !result; i++) {
            if (v[i] != Long.MIN_VALUE && v[i-1] != Long.MIN_VALUE) {
                if (v[i] < v[i-1]) result = true;
            }
        }

        if (n == k1) {
            for (int i = 0; i < n; i++) {
                if (v[i] == Long.MIN_VALUE) v[i] = 0;
            }
        }
        for (int i = 0; i < n && !result; i++) {
            if (v[i] != Long.MIN_VALUE) continue;
            int j = i;
            while (j < n && v[j] == Long.MIN_VALUE) j++;
            int c = j - i;
            if (i >= 1 && j < n && (v[j] - v[i - 1]) <= c) {result = true; break;}

            if (i == 0 && j == n) {
                int kk = -((j - i) / 2);
                v[i] = kk;
                for (int k = i + 1; k < j; k++) v[k] = v[k-1] + 1;
            } else if (j == n && i > 0 && v[i - 1] < 0) {
                long kk = ((j - i) / 2);
                kk = -kk;
                if (v[i - 1] >= kk) kk = v[i - 1] + 1;
                v[i] = kk;
                for (int k = i + 1; k < j; k++) v[k] = v[k-1] + 1;
            } else if(i == 0 && j < n && v[j] > 0){
                long kk = (j - i) / 2;
                if (v[j] <= kk) kk = v[j] - 1;
                v[j - 1] = kk;
                for (int k = j - 2; k >=i; k--) v[k] = v[k+1] - 1;
            } else if(i > 0 && j < n && v[i-1] < 0 && v[j] > 0) {
                if (Math.abs(v[j]) < Math.abs(v[i - 1])) {
                    long kk = (j - i) / 2;
                    if (v[j] <= kk) kk = v[j] - 1;
                    v[j - 1] = kk;
                    for (int k = j - 2; k >=i; k--) v[k] = v[k+1] - 1;
                } else {
                    long kk = ((j - i) / 2);
                    kk = -kk;
                    if (v[i - 1] >= kk) kk = v[i - 1] + 1;
                    v[i] = kk;
                    for (int k = i + 1; k < j; k++) v[k] = v[k-1] + 1;
                }
            }
            else if (j < n && v[j] <= 0) {
                for (int k = j - 1; k >= i; k--) v[k] = v[k + 1] - 1;
            }
            else if (i > 0 && v[i - 1] >= 0) {
                for (int k = i; k < j;  k++) v[k] = v[k - 1] + 1;
            }
            i = j;
        }

        if (result) System.out.print("Incorrect sequence");
        else {
            int i = 0;

            for (; i < n; i++) {
                System.out.print(v[i] + " ");
            }
        }
    }
}