Relay Team#12535

Relay Team

1 second

256 megabytes

Very easy

Coach Marta is putting together a relay team. She timed every student who tried out, and now she wants to pick the $k$ fastest ones and list their times from fastest to slowest, so she can decide the running order.

Given $n$ students' times and a number $k$ , find the $k$ smallest times among them and print them in increasing order.

Input

The first line contains two integers $n$ and $k$ — the number of students who tried out and the number of runners Marta needs for the team ( $1 \leq k \leq n \leq 1000$ 1 \leq k \leq n \leq 1000).

The second line contains $n$ integers $t_{1}, t_{2}, \dots, t_{n}$ t_1, t_2, \ldots, t_n — the time (in seconds) each student ran, $1 \leq t_{i} \leq 1 0^{6}$ 1 \leq t_i \leq 10^6. Times may repeat.

Output

Print $k$ integers — the times of the $k$ fastest students, in increasing order.

Examples

Example

Loading

Example 2

Loading

1 \leq k \leq n \leq 1000

t_{1}, t_{2}, \dots, t_{n}

1 \leq t_{i} \leq 1 0^{6}