Multisets (3)

Write a program that, given two numbers $n$ and $t$ , prints all the multisets with $t$ numbers that can be made up with $\{1, \dots, n\}$ .

Input

Input consists of a natural number $n > 0$ , followed by a natural number $t \ge 0$ .

Output

Print all the multisets of size $t$ that can be made up with $\{1, \dots, n\}$ . The numbers inside each multiset must appear in non-decreasing order.

Information about the checker

You can print the solutions to this exercise in any order.

Problem information

Author: Unknown
Translator: Salvador Roura

Generation: 2026-01-25T10:13:46.496Z