You are given a string $$$s$$$ consisting of $$$n$$$ lowercase Latin letters.
You need to distribute all letters from $$$s$$$ into $$$k$$$ strings $$$t_1, t_2, \dots, t_k$$$. Each letter of the string $$$s$$$ must belong to exactly one of the $$$k$$$ strings, but some of the strings $$$t_i$$$ may remain empty.
Moreover, you may arrange the letters inside each string $$$t_i$$$ in any order.
Your task is to minimize the lexicographic maximum among all $$$t_i$$$ and output it.
A string $$$a$$$ is lexicographically smaller than string $$$b$$$ if and only if one of the following holds:
In particular, this means that the empty string is lexicographically the smallest.
The first line contains two integers $$$n$$$ and $$$k$$$ ($$$1 \le n \le 10^6$$$; $$$1 \le k \le n$$$) — the length of the string $$$s$$$ and the number of strings which you need to distribute it into.
The second line contains the string $$$s$$$ itself, consisting of $$$n$$$ lowercase Latin letters.
Print one string — the minimum possible lexicographic maximum among all $$$t_i$$$.
3 2zzz
zz
7 7saratov
aaorstv