CF1230B.Ania and Minimizing

Ania 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?

阿尼娅有一个很大的整数 $S$。其十进制表示的长度为 $n$，且不含前导零。阿尼娅最多可以修改 $S$ 的 $k$ 位数字。她希望以这样的方式修改：使得 $S$ 仍不包含前导零，且其值尽可能小。最终阿尼娅将得到哪个整数？

The 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.

第一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 200\,000$，$0 \leq k \leq n$）—— 分别表示 $S$ 的十进制表示中的位数，以及允许修改的最大位数。

第二行包含整数 $S$。保证 $S$ 恰好有 $n$ 位数字，且不含前导零。

Output the minimal possible value of $S$ which Ania can end with. Note that the resulting integer should also have $n$ digits.

输出安娜最终能得到的 $S$ 的最小可能值。注意，得到的整数也应具有 $n$ 位数字。

A 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.

如果一个数字至少包含两位数字，且其首位数字为 $0$，则该数字具有前导零。例如，数字 $00$、$00069$ 和 $0101$ 具有前导零，而 $0$、$3000$ 和 $1010$ 则没有前导零。