N and M (1)

Print every length-M sequence of distinct numbers chosen from 1 to N, in increasing lexicographic order.

Easy3BacktrackingRecursionInterviewNo attempts yetTime limit1sMemory limit512 MB

Description

Examples3

Problem

You are given natural numbers $N$ and $M$ . Write a program that finds every sequence of length $M$ made by choosing $M$ numbers from $1$ to $N$ without repetition.

Input

The first line contains the natural numbers $N$ and $M$ , separated by a space. ( $1 \le M \le N \le 8$ )

Output

Print the sequences that satisfy the condition, one per line. Do not print the same sequence twice, and separate the numbers of a sequence with a space. Print the sequences in increasing lexicographic order.