B. Ania and Minimizingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnia has a large integer S. Its decimal representation has length n and doesn't contain any leading zeroes. Ania is allowed to change at most k digits of S. She wants to do it in such a way that S still won't contain any leading zeroes and it'll be minimal possible. What integer will Ania finish with?InputThe first line contains two integers n and k (1 \leq n \leq 200\,000, 0 \leq k \leq n) — the number of digits in the decimal representation of S and the maximum allowed number of changed digits.The second line contains the integer S. It's guaranteed that S has exactly n digits and doesn't contain any leading zeroes.OutputOutput the minimal possible value of S which Ania can end with. Note that the resulting integer should also have n digits.ExamplesInput
5 3
51528
Output
10028
Input
3 2
102
Output
100
Input
1 1
1
Output
0
NoteA number has leading zeroes if it consists of at least two digits and its first digit is 0. For example, numbers 00, 00069 and 0101 have leading zeroes, while 0, 3000 and 1010 don't have leading zeroes.
5 3
51528

10028 
['greedy', 'implementation', '*1000']