B. A Tide of Riverscape

 

 

 

B. A Tide of Riverscape

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ss 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 pp 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 pp is considered a period of string ss, if for all 1≤i≤|s|−p1≤i≤|s|−p, the ii-th and (i+p)(i+p)-th characters of ssare the same. Here |s||s| is the length of ss.

Input

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

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

Output

Output one line — if it's possible that pp 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

Copy

10 7
1.0.1.0.1.

output

Copy

1000100010

input

Copy

10 6
1.0.1.1000

output

Copy

1001101000

input

Copy

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

output

Copy

No

Note

In the first example, 77 is not a period of the resulting string because the 11-st and 88-th characters of it are different.

In the second example, 66 is not a period of the resulting string because the 44-th and 1010-th characters of it are different.

In the third example, 99 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.

 

 

写的很乱，结果当时就少考虑了种情况qwq，

我写的挺麻烦的，实际上一层for就可以

 

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main(){

    char a[2005];
    int vis[2005]={0};
    int n,p;
    scanf("%d%d",&n,&p);
    scanf("%s",a);

    int i;
    int f=0;
    for(i=0;i<n-p;i++)
    {
        if(vis[i])
            continue;
        if(a[i]=='.')
        {
            int j;
            for(j=i+p;j<n;j+=p)
            {
                if(a[j]!='.')
                {
                    if(a[j]=='0')
                        a[i]='1';
                    else
                        a[i]='0';
                }
                else
                {
                    a[j]='0',a[i]='1';
                    break;
                }
            }
            if(a[i]=='.')
            {
                for(j=i-p;j>=0;j-=p)
                {
                    if(a[j]!='.')
                    {
                        if(a[j]=='0')
                            a[i]='1';
                        else
                            a[i]='0';
                    }
                    else
                    {
                        a[j]='0',a[i]='1';
                        break;
                    }
                }
            }
            if(a[i]!='.')break;
        }
        else
        {
            int j;
            for(j=i+p;j<n;j+=p)
            {
                if(a[j]!='.'&&a[j]!=a[i])
                {
                    f=1;
                    break;
                }
                else if(a[j]=='.')
                {
                    if(a[i]=='1')
                        a[j]='0';
                    else
                        a[j]='1';
                    f=1;
                    break;
                }

                vis[j]=1;
            }
            for(j=i-p;j>=0;j-=p)
            {
                if(a[j]!='.'&&a[j]!=a[i])
                {
                    f=1;
                    break;
                }
                else if(a[j]=='.')
                {
                    if(a[i]=='1')
                        a[j]='0';
                    else
                        a[j]='1';
                    f=1;
                    break;
                }
                vis[j]=1;
            }
            if(f)
                break;
        }
    }
    if(i>=n-p)
    {
        printf("No\n");
        return 0;
    }
    for(int i=0;i<n;i++)
    {
        if(a[i]=='.')
        {
            a[i]='0';
        }
    }
    puts(a);

    return 0;
}