You are given N natural numbers and a natural number M. Write a program that finds every sequence of length M that satisfies the conditions below. The N natural numbers are all different.
the sequence consists of M numbers chosen from the given N natural numbers
the chosen sequence is in ascending order
Input
The first line contains N and M. (1≤M≤N≤8)
The second line contains N numbers. Every number given in the input is a natural number less than or equal to 10,000.
Output
Print one sequence that satisfies the conditions per line. Do not print the same sequence twice, and separate the elements of each sequence with a space.
Print the sequences in increasing lexicographic order.