시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 43 29 29 69.048%

## 문제

Pia is getting ready for her flight to the NWERC 2018 in Eindhoven. As she is packing her hard drive, she remembers the airline’s ridiculous weight restrictions, which may pose a problem. You see, the hard drive is essentially a string of ones and zeros, and its weight depends on the number of “bit changes” in it: for any two adjacent bits storing two different values, the hard drive gets slightly heavier, so Pia cannot just store arbitrary information on it.

To make matters worse, the drive is so old that some bits are already broken and will always store zeros. The first bit will never be broken, but the last bit will always be.

Pia decides to treat this situation as a challenge: she is now trying to modify the information on the hard drive so that it has exactly the maximum number of bit changes permitted by the airline. However, the broken bits make this harder than expected, so she needs your help.

Find a bit pattern which can be stored on the hard drive and has exactly the desired number of bit changes.

## 입력

The input consists of:

• One line with three integers n, c, and b (2 ≤ n ≤ 5 · 105, 1 ≤ c, b ≤ n − 1), the size of the hard drive in bits, the desired amount of bit changes, and the number of broken bits. The positions on the hard drive are numbered from 1 to n.
• One line with b integers z1, . . . , zb (2 ≤ z1 < z2 < . . . < zb = n), the positions of the broken bits on the hard drive.

## 출력

Output a bit string of length n, representing Pia’s hard drive and containing exactly c bit changes. If there are multiple valid solutions, you may output any one of them. It is guaranteed that at least one solution exists.

## 예제 입력 1

5 2 3
2 3 5


## 예제 출력 1

00010


## 예제 입력 2

7 4 2
2 7


## 예제 출력 2

0010110


## 출처

• 문제를 만든 사람: Stefan Kraus