Score : $200$ points

Problem Statement

There were $N$ participants in a contest. The participant ranked $i$-th had the nickname $S_i$. Print the nicknames of the top $K$ participants in lexicographical order.

Constraints

• $1 \leq K \leq N \leq 100$
• $K$ and $N$ are integers.
• $S_i$ is a string of length $10$ consisting of lowercase English letters.
• $S_i \neq S_j$ if $i \neq j$.

Input

The input is given from Standard Input in the following format:

$N$ $K$

$S_1$

$S_2$

$\vdots$

$S_N$

Output

Print the nicknames, separated by newlines.

5 3
abc
aaaaa
xyz
a
def

aaaaa
abc
xyz

This contest had five participants. The participants ranked first, second, third, fourth, and fifth had the nicknames abc, aaaaa, xyz, a, and def, respectively.

The nicknames of the top three participants were abc, aaaaa, xyz, so print these in lexicographical order: aaaaa, abc, xyz.

4 4
z
zyx
zzz
rbg

rbg
z
zyx
zzz

3 1
abc
arc
agc

abc