N and M (12)

You are given $N$ natural numbers and a natural number $M$. Write a program that finds every sequence of length $M$ satisfying all of the conditions below.

• The sequence is made by choosing $M$ of the given $N$ numbers.
• You may choose the same number more than once.
• The sequence is non-decreasing. A sequence $A$ of length $K$ is non-decreasing when $A_1 \le A_2 \le \cdots \le A_{K-1} \le A_K$ holds.

The first line contains $N$ and $M$. ($1 \le M \le N \le 8$)

The second line contains $N$ numbers. Every number given in the input is a natural number no greater than 10,000.

Print one sequence that satisfies the conditions per line. Do not print the same sequence more than once, and separate the numbers of a sequence with a space.

Print the sequences in increasing lexicographic order.