Codeforces Round #487 (Div. 2) 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 $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\le i\le \left|s\right|-p$, the $i$-th and $(i+p)$-th characters of $s$ are the same. Here $\left|s\right|$ is the length of $s$.

Input

The first line contains two space-separated integers $n$ and $p$ ($1\le p\le n\le 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

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, $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.

题意：给你字符串长为n，字符有0，1，.三种.是可以填成1或0，要你判断再填好.的基础上是否存在对于所有的i（1<=i<=n-k)与i+k不相同的填法

题解：暴力，一个循环i从1到n-l，看是否能找到不同，找到之并填好.之后，直接输出

代码：

#include <bits/stdc++.h>
using namespace std;
const int M = 1e6 + 10;
string s;
int n, k;
int main()
{
	cin >> n >> k;
	cin >> s;
	int p = 1;
	//cout << s << endl;
	for (int i = 0; i<n - k; i++)
	{
		if (s[i] == s[i + k])
		{
			if (s[i] == '0')
			{
				continue;
			}
			else if (s[i] == '1')
			{
				continue;
			}
			else if (s[i] == '.')
			{
				p = 0;
				s[i] = '0';
				s[i + k] = '1';
				break;
			}
		}
		else
		{
			if (s[i] == '0'&&s[i + k] == '1')
			{
				p = 0;
				break;
			}
			else if (s[i] == '0'&&s[i + k] == '.')
			{
				p = 0;
				s[i + k] = '1';
				break;
			}
			else if (s[i] == '.'&&s[i + k] == '0')
			{
				p = 0;
				s[i] = '1';
				break;
			}
			else if (s[i] == '.'&&s[i + k] == '1')
			{
				p = 0;
				s[i] = '0';
				break;
			}
			else if (s[i] == '1'&&s[i + k] == '0')
			{
				p = 0;
				break;
			}
			else if (s[i] == '1'&&s[i + k] == '.')
			{
				p = 0;
				s[i + k] = '0';
				break;
			}
		}
	}
	if (!p)
	{
		for (int i = 0; i<n; i++)
		{
			if (s[i] == '.')
				cout << 0;
			else
				cout << s[i];
		}
		cout << endl;
	}
	else
	{
		cout << "No" << endl;
	}
}