h2. Date de ieşire

The only line of the output file $minperm.out$ should contain $n$ elements, representing the best order for showing the attractions.

În fişierul de ieşire $minperm.out$ ...

h2. Restricţii

* $1 ≤ k ≤ n ≤ 5000$
* For tests worth $10$ points, $1 ≤ k ≤ n ≤ 8$
* For tests worth $30$ more points, $1 ≤ k ≤ n ≤ 100$

* $... ≤ ... ≤ ...$

h2. Exemplu
table(example). |_. minperm.in |_. minperm.out |

| 8 1
1 4 3 5 7 2 8 6
8
| 1 4 3 5 7 2 8 6

| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.

|

table(example). |_. minperm.in |_. minperm.out |
| 8 7
2 4 1 5 3 6 7 8
7 6 3 8 2 5 1
| 1 2 3 4 5 6 7 8
|

h3. Explicaţie
...

== include(page="template/taskfooter" task_id="minperm") ==