We are going to paint a sign but we can only afford stencils for $k$ letters. Update the text of the sign to use only $k$ unique letters without changing the lengths of any of the words, so that we can subtly fix the sign later.

Figure A.1: Illustration of Sample Input 1. You can do this!

Input

• The first line of input contains the number of words, $n$ ($1 \le n \le 1000$), and the number of letters, $k$ ($1 \le k \le 26$).
• The second line of input contains $n$ words. Each word consists of between $1$ and $20$ lowercase latin letters.

Output

Output a phrase using at most $k$ distinct letters, substituting as few from the original text as possible. If there are multiple possible answers, output any.

Examples

Input 1

2 3
good luck

Output 1

lool lull

Input 2

3 1
this is hard

Output 2

ssss ss ssss

Input 3

1 6
impossible

Output 3

imbossibee