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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {

		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;

		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);

		TaskE solver = new TaskE();
		solver.solve(1, in, out);
		out.close();
	}

}

class TaskA {

	public void solve(int testNumber, InputReader in, PrintWriter out) {
		String s = in.next();
		String t = in.next();

		char[] n = new char[s.length()];
		for (int i = 0; i < s.length(); ++i) {
			n[i] = s.charAt(i);
		}

		boolean modified = false;
		for (int i = s.length() - 1; i >= 0; --i) {
			if (n[i] < 'z') {
				modified = true;
				n[i]++;
				for (int j = i + 1; j < s.length(); ++j) {
					n[j] = 'a';
				}
				break;
			}
		}

		if (modified && t.compareTo(new String(n)) > 0) {
			out.println(new String(n));
		} else {
			out.println("No such string");
		}
	}

}

class TaskB {

	public void solve(int testNumber, InputReader in, PrintWriter out)
			throws IOException {

		String s = in.next();
		String t = in.next();

		int ura = 0;
		int opa = 0;

		int[] m = new int['z' + 1];

		for (int i = 0; i < t.length(); ++i) {
			m[t.charAt(i)]++;
		}

		boolean[] processed = new boolean[s.length()];

		for (int i = 0; i < s.length(); ++i) {
			if (!processed[i] && m[s.charAt(i)] > 0) {
				m[s.charAt(i)]--;
				ura++;
				processed[i] = true;
			}
		}

		for (int i = 0; i < s.length(); ++i) {
			if (!processed[i] && m[neibh(s.charAt(i))] > 0) {
				m[neibh(s.charAt(i))]--;
				opa++;
				processed[i] = true;
			}
		}

		out.println(ura + " " + opa);

	}

	private int neibh(char ch) {
		if (ch >= 'a' && ch <= 'z') {
			return ch - 32;
		} else {
			return ch + 32;
		}
	}

}

class TaskC {

	public void solve(int testNumber, InputReader in, PrintWriter out) {

		int n = in.nextInt();
		int m = in.nextInt();
		int k = in.nextInt();

		int[] pos = new int[n];
		int[] programs = new int[n];

		for (int i = 0; i < n; ++i) {
			int program = in.nextInt() - 1;
			pos[program] = i;
			programs[i] = program;
		}

		int touches = 0;

		int menuPosition = 0;

		for (int i = 0; i < m; ++i) {
			int program = in.nextInt() - 1;
			int position = pos[program];
			// out.println("touches "+calculate(position,k));
			touches += calculate(position, k, menuPosition);
			if (position != 0) {
				pos[program]--;
				int incProgram = programs[pos[program]];
				// out.println("Inc "+(incProgram+1));
				pos[incProgram]++;
				swap(programs, pos[program], pos[incProgram]);
			}
		}

		out.println(touches);

	}

	private void swap(int[] p, int p1, int p2) {
		int tmp = p[p1];
		p[p1] = p[p2];
		p[p2] = tmp;
	}

	private int calculate(int position, int k, int menuPosition) {
		if (position == 0) {
			return 1;
		} else {
			return 1 + Math.abs((position) / k - (menuPosition) / k);
		}
	}

}

class TaskD {

	public void solve(int testNumber, InputReader in, PrintWriter out) {

		int n = Integer.parseInt(in.next());
		double p = Double.parseDouble(in.next());
		int t = Integer.parseInt(in.next());

		double[][] pm = new double[2100][2100];

		pm[1][0] = 1 - p;
		pm[1][1] = p;

		for (int i = 2; i <= t; ++i) {
			for (int j = 0; j <= n; ++j) {
				if (j > 0) {
					pm[i][j] += pm[i - 1][j - 1] * (p);
				}
				if (j < n) {
					pm[i][j] += pm[i - 1][j] * (1 - p);
				} else {
					pm[i][j] += pm[i - 1][j];
				}
			}
		}

		double result = 0;

		for (int i = 0; i <= n; ++i) {
			result += (pm[t][i]) * ((double) i);
		}
		out.println(result);
	}

}

class TaskE {

	public void solve(int testNumber, InputReader in, PrintWriter out) {
		int n = in.nextInt();
		int k = in.nextInt();

		int p = 1000000001;

		int[] a = new int[n];

		for (int i = 0; i < n; ++i) {
			String s = in.next();
			if ("?".equals(s)) {
				a[i] = p;
			} else {
				a[i] = Integer.parseInt(s);
			}
		}

		boolean hasPrev = false;
		int prev = 0;
		int current = 0;
		for (int i = 0; i < n; ++i) {

			if (i >= k) {
				hasPrev = true;
				prev = current;
				current = prev - a[i - k];
			}

			int num = a[i];

			if (num == p) {
				if (!hasPrev) {
					a[i] = 0;
				} else {
					if(prev<0){
						a[i] = (current + prev) + 1;
					}else{
						a[i] = (current - prev) + 1;
					}
				}
				
			}
			current += a[i];
			if(hasPrev&&current<=prev){
				out.println("Incorrect sequence");
				return;
			}
		}
		for(int i=0;i<a.length;++i){
			out.print(a[i]+" ");
		}
	}

}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = null;
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

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

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

}