Subsets (2)

Write a program that, given a natural number $m$ and $n$ different words $s_1, \dots, s_n$ , prints all the subsets of $m$ elements that can be made up with the words.

Input

Input consists of two natural numbers $m$ and $n$ , followed by $s_1, \dots, s_n$ . Assume $n > 0$ and $0 \le m \le n$ .

Output

Print all the subsets of $m$ words that can be made up with $s_1, \dots, s_n$ .

Information about the checker

You can print in any order both the solutions and the elements inside each solution.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T10:19:03.111Z