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 

//package codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class E {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(System.out);
    StringTokenizer stringTokenizer;

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(reader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    final int MOD = 1000 * 1000 * 1000 + 7;

    int sum(int a, int b) {
        a += b;
        return a >= MOD ? a - MOD : a;
    }

    int product(int a, int b) {
        return (int) (1l * a * b % MOD);
    }

    int[][] mul(int[][] a, int [][] b) {
        final int n = a.length;
        int[][] c = new int[n][n];
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                for(int k = 0; k < n; k++) {
                    c[i][j] = sum(c[i][j], product(a[i][k], b[k][j]));
                }
            }
        }
        return c;
    }
    int[][] pow(int[][] a, int k) {
        int n = a.length;
        int[][] res = new int[n][n];
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                res[i][j] = i == j ? 1 : 0;
            }
        }
        while(k > 0) {
            if(k % 2 == 1) {
                res = mul(res, a);
            }
            a = mul(a, a);
            k /= 2;
        }
        return res;
    }

    @SuppressWarnings("unchecked")
    void solve() throws IOException {
        int n = nextInt();
        int p = nextInt();
        int[] a = new int[n];
        final int UNKNOWN = Integer.MIN_VALUE;
        for(int i = 0; i < n; i++) {
            String next = next();
            if(next.charAt(0) == '?') {
                a[i] = UNKNOWN;
            } else {
                a[i] = Integer.parseInt(next);
            }
        }
        String fail = "Incorrect sequence";
        for(int k = 0; k < p; k++) {
            int firstPositive = n;
            for(int i = k; i < n; i += p) {
                if(a[i] >= 0) {
                    firstPositive = i;
                    break;
                }
            }
            int lastNegative = -1;
            for(int i = k; i < n; i += p) {
                if(a[i] != UNKNOWN && a[i] < 0) {
                    lastNegative = i;
                }
            }
            if(lastNegative > firstPositive) {
                writer.println(fail);
                writer.close();
                return;
            }
            if(firstPositive < n) {
                int f = a[firstPositive];
                for (int i = firstPositive + p; i < n; i += p) {
                    if (a[i] == UNKNOWN) a[i] = f + 1;
                    if (a[i] <= f) {
                        writer.println(fail);
                        writer.close();
                        return;
                    }
                    f = a[i];
                }
            }
            if(lastNegative > -1) {
                int f = a[lastNegative];
                for(int i = lastNegative - p; i >= 0; i -= p) {
                    if(a[i] == UNKNOWN) a[i] = f - 1;
                    if(a[i] >= f) {
                        writer.println(fail);
                        writer.close();
                        return;
                    }
                    f = a[i];
                }
            }
            int countUnknown = 0;
            for(int i = k; i < n; i += p) {
                if(a[i] == UNKNOWN) {
                    countUnknown++;
                }
            }
            if(countUnknown == 0) continue;
            int hi = countUnknown / 2;
            int lo = hi - countUnknown + 1;
            int loLimit = lastNegative > -1 ? a[lastNegative] : Integer.MIN_VALUE;
            int hiLimit = firstPositive < n ? a[firstPositive] : Integer.MAX_VALUE;
            if(lo <= loLimit) {
                int diff = loLimit - lo + 1;
                lo += diff;
                hi += diff;
            }
            if(hi >= hiLimit) {
                int diff = hi - hiLimit + 1;
                lo -= diff;
                hi -= diff;
            }
            if(lo <= loLimit || hi >= hiLimit) {
                writer.println(fail);
                writer.close();
                return;
            }
            for(int i = k; i < n; i += p) {
                if(a[i] == UNKNOWN) {
                    a[i] = lo++;
                }
            }
        }
        for (int i : a) {
            writer.print(i + " ");
        }
        writer.close();
    }

    public static void main(String[] args) throws IOException {
        new E().solve();
    }
}


