Problem: Walking along a riverside, Mino silently takes a note of something.

"Time," Mino thinks aloud.

"What?"

"Time and tide wait for no man," explains Mino. "My name, taken from the river, always reminds me of this."

"And what are you recording?"

"You see it, tide. Everything has its own period, and I think I've figured out this one," says Mino with confidence.

Doubtfully, Kanno peeks at Mino's records. 

The records are expressed as a string s of characters '0', '1' and '.', where '0' denotes a low tide, '1' denotes a high tide, and '.' denotes an unknown one (either high or low).

You are to help Mino determine whether it's possible that after replacing each '.' independently with '0' or '1', a given integer p is not a period of the resulting string. In case the answer is yes, please also show such a replacement to Mino.

In this problem, a positive integer p is considered a period of string s, if for all 1 ≤ i ≤ \lvert s \rvert - p, the i-th and (i + p)-th characters of s are the same. Here \lvert s \rvert is the length of s.

Input

The first line contains two space-separated integers n and p (1 ≤ p ≤ n ≤ 2000) — the length of the given string and the supposed period, respectively.

The second line contains a string s of n characters — Mino's records. s only contains characters '0', '1' and '.', and contains at least one '.' character.

Output

Output one line — if it's possible that p is not a period of the resulting string, output any one of such strings; otherwise output "No" (without quotes, you can print letters in any case (upper or lower)).

Examples

Input

10 7
1.0.1.0.1.


Output

1000100010


Input

10 6
1.0.1.1000


Output

1001101000


Input

10 9
1........1


Output

No

Note

In the first example, 7 is not a period of the resulting string because the 1-st and 8-th characters of it are different.

In the second example, 6 is not a period of the resulting string because the 4-th and 10-th characters of it are different.

In the third example, 9 is always a period because the only constraint that the first and last characters are the same is already satisfied.

Note that there are multiple acceptable answers for the first two examples, you can print any of them.

Solution (in JAVA):

Solution:


import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class cfq {
	static final double EPS = 1e-9;

	
//	static int r, c;
	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
	    int p =sc.nextInt();
	    char x [] = new char [n];
	    x=sc.next().toCharArray();
	    
	    int f=0;
	    
	    for(int i=0;i<n-p;i++) {
	    	if(x[i]=='.'&&x[i+p]=='.') {
	    		x[i]='0';
	    		x[i+p]='1';
	    		f=1;
	    		break;
	    	}
	    	
	    	if(x[i]=='1'&&x[i+p]=='.') {
	    		x[i+p]='0';
	    		f=1;
	    		break;
	    	}
	    	if(x[i]=='0'&&x[i+p]=='.') {
	    		x[i+p]='1';
	    		f=1;
	    		break;
	    	}
	    	
	    	if(x[i]=='.'&&x[i+p]=='0') {
	    		x[i]='1';
	    		f=1;
	    		break;
	    	}
	    	if(x[i]=='.'&&x[i+p]=='1') {
	    		x[i]='0';
	    		f=1;
	    		break;
	    	}
	    	
	    	if(x[i]=='0'&&x[i+p]=='1') {
	    	
	    		f=1;
	    		break;
	    	}
	       	if(x[i]=='1'&&x[i+p]=='0') {
		    	
	    		f=1;
	    		break;
	    	}
	    	
	    }
	   
	    
	    if(f==0) {
	    	System.out.println("No");
	    	return;
	    }
	    
	    for(int i=0;i<n;i++)
	    	if(x[i]=='.')
	    		x[i]='0';
	    
	    
	    StringBuilder sb = new StringBuilder();
	    for(int i=0;i<n;i++) {
	    	sb.append(x[i]);
	    }
	    
	    System.out.println(sb.toString());
	    
	}
	
	
	
//	static boolean valid (int x, int y) {
//		return x<r&&y<c&&x>-1&&y>-1;
//	}

	static long incWhite(long horiWfrom, long horiWto, long verWfrom, long verWto) {
		long tot = 0;
		tot += horiWto - horiWfrom + 1;
		tot /= 2;
		tot *= (verWto - verWfrom + 1);
		if ((horiWto - horiWfrom + 1) % 2 != 0) {
			if ((even(horiWto) & even(verWfrom)) || (!even(horiWto) & !even(verWfrom))) {
				// white at base
				tot += (verWto - verWfrom + 1) / 2;
			} else {
				tot += (verWto - verWfrom + 1) / 2;
				if ((verWto - verWfrom + 1) % 2 != 0)
					tot++;
			}
		}
		return tot;
	}

	static long incblack(long horiWfrom, long horiWto, long verWfrom, long verWto) {
		long tot = 0;
		tot += horiWto - horiWfrom + 1;
		tot /= 2;
		tot *= (verWto - verWfrom + 1);
		if ((horiWto - horiWfrom + 1) % 2 != 0) {
			if ((even(horiWto) & even(verWfrom)) || (!even(horiWto) & !even(verWfrom))) {
				// white at base
				tot += (verWto - verWfrom + 1) / 2;
				if ((verWto - verWfrom + 1) % 2 != 0)
					tot++;
			} else {
				tot += (verWto - verWfrom + 1) / 2;
			}
		}
		return tot;
	}

	static boolean even(long k) {
		return k % 2 == 0;
	}

	

	

	static pair[] shuffle(pair[] a) {
		int n = a.length;
		for (int i = 0; i < n; i++) {
			int r = i + (int) (Math.random() * (n - i));
			pair tmp = a[i];
			a[i] = a[r];
			a[r] = tmp;
		}
		return a;
	}

	public static class pair implements Comparable<pair> {

		long power, idx, own, original;

		pair(long a, long b, long c) {
		    power = a;
			idx = b;
			own=c;
			original=c;
		}

		public int compareTo(pair p) {
			if (Math.abs(power - p.power) > EPS)
				return power > p.power ? 1 : -1;
			if (Math.abs(idx - p.idx) > EPS)
				return idx > p.idx ? 1 : -1;
			return 0;
		}
	}
	
	public static class pairz implements Comparable<pairz> {

		long power, idx, own, original;

		pairz(long a, long b, long c) {
		    power = a;
			idx = b;
			own=c;
			original=c;
		}

		public int compareTo(pairz p) {
			if (Math.abs(idx - p.idx) > EPS)
				return idx > p.idx ? 1 : -1;
		
			return 0;
		}
	}

	public static class pair2 implements Comparable<pair2> {

		int x, y;

		pair2(int a, int b) {
			x = a;
			y = b;
		}

		public int compareTo(pair2 p) {
			if (Math.abs(y - p.y) > EPS)
				return y > p.y ? 1 : -1;
			if (Math.abs(x - p.x) > EPS)
				return x > p.x ? 1 : -1;
			return 0;
		}
	}

	public static class kair implements Comparable<kair> {

		ArrayList<Integer> ar;
		int s;

		kair(ArrayList<Integer> a, int b) {
			ar = a;
			s = b;
		}

		// desc version
		public int compareTo(kair p) {
			if (Math.abs(s - p.s) > EPS)
				return s < p.s ? 1 : -1;

			return 0;
		}
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

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

		public Scanner(String file) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(file));
		}

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

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public long nextlong() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			long res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}
}