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.*;
import java.util.*;
import java.math.*;
public class cf487b
{ 
	public static int M = 1000000007;
    public static void main(String[] args)throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        String[] s = br.readLine().split(" ");	
        String str = br.readLine();
        int n = Integer.parseInt(s[0]);
        int p = Integer.parseInt(s[1]);
        int count=0;
        for(int i=0;i<n-p;i++)
            if((str.charAt(i)==str.charAt(i+p))&& str.charAt(i)!='.')
                count++;
        if(count==n-p)
            out.println("No");
        else
        {
            char[] sol = str.toCharArray();
            for(int i=0;i<n;i++)
            {
                if(i+p<n)
                {
                    
                    if(sol[i]=='.' && sol[i+p]=='.')
                    {
                        sol[i]='1';
                        sol[i+p]='0';
                    }
                    else
                    {
                        if(sol[i]=='.' && sol[i+p]=='0')
                            sol[i]='1';
                        if (sol[i]=='0' && sol[i+p]=='.')
                            sol[i+p]='1';
                        if (sol[i]=='1' && sol[i+p]=='.')
                            sol[i+p]='0';
                        if (sol[i]=='.' && sol[i+p]=='1')
                            sol[i]='0';
                    }
                }
                else
                {
                    if(sol[i]=='.')
                        sol[i]='1';
                }
                
            }
            out.println(new String(sol));
        }
        out.flush();
    }
    /** Loops
    *	i: for(int i=0;i<n;i++)
    *	j: for(int j=0;j<n;j++)
    *	k: for(int k=0;k<n;k++)

    *	ArrayList<Integer> arr1 = new ArrayList<>();
    
    * 	HashMap
    *	HashMap<Integer, Integer> hm = new HashMap<>();
    * 	for (Map.Entry<String,String> entry : hm.entrySet()) 
    		out.println(entry.getValue());
    
    *	Count frequencies
    	for(int i=0;i<n;i++)
        {
            Integer c = hm.get(Integer.parseInt(s[i]));
            if(c==null)
                hm.put(Integer.parseInt(s[i]),1);
            else
                hm.put(Integer.parseInt(s[i]),++c);
        }
	**/		
    public static long modularExpo(long x,long n,int M)
	{
		long result=1;
		while(n>0)
		{
		    if(n%2==1)
		        result=(result*x)%M;
		    x=(x*x)%M;
		    n=n/2;
		}	
		return result;												
	}
	//FLT, only when a and M are co-prime
	public static long modInverse(int a,int M)
	{
		long g = gcd(a,M);
		if(g!=1)
			return -1;
	    return modularExpo(a,M-2,M);
	}
	public static long gcd(int a, int b) 
	{
	    if(b==0)
	        return a;
	    else
	        return gcd(b, a % b);
	}
}