B. Minimizing the Maximum
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

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:

  • $$$a$$$ is a prefix of $$$b$$$, but $$$a \ne b$$$; or
  • in the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$b$$$.

In particular, this means that the empty string is lexicographically the smallest.

Input

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.

Output

Print one string — the minimum possible lexicographic maximum among all $$$t_i$$$.

Examples
Input
3 2
zzz
Output
zz
Input
7 7
saratov
Output
aaorstv