#描述#
In the
German Lotto you have to select 6 numbers from the set {1,2,...,49}.</span></p>
<p style="margin:0cm;margin-bottom:.0001pt;text-align:justify;text-justify:
inter-ideograph">
<span lang="EN" style="font-size: 10.5pt; font-family: Times New Roman"> </span></p>
<p style="margin:0cm;margin-bottom:.0001pt;text-align:justify;text-justify:
inter-ideograph">
<span lang="EN" style="font-size: 10.5pt; font-family: Times New Roman">A
popular strategy to play Lotto - although it doesn't increase your chance of
winning - is to select a subset S containing <i>k</i> (<i>k</i>>6) of these 49
numbers, and then play several games with choosing numbers only from S.</span></p>
<p style="margin:0cm;margin-bottom:.0001pt;text-align:justify;text-justify:
inter-ideograph">
<span lang="EN" style="font-size: 10.5pt; font-family: Times New Roman"> </span></p>
<p style="margin:0cm;margin-bottom:.0001pt;text-align:justify;text-justify:
inter-ideograph">
<span lang="EN" style="font-size: 10.5pt; font-family: Times New Roman">For
example, for <i>k</i>=8 and S = 1,2,3,5,8,13,21,34 there are 28 possible games:
[1,2,3,5,8,13], [1,2,3,5,8,21], [1,2,3,5,8,34], [1,2,3,5,13,21], ...,
[3,5,8,13,21,34].</span></p>
<p style="margin:0cm;margin-bottom:.0001pt;text-align:justify;text-justify:
inter-ideograph">
<span lang="EN" style="font-size: 10.5pt; font-family: Times New Roman"> </span></p>
<p style="margin:0cm;margin-bottom:.0001pt;text-align:justify;text-justify:
inter-ideograph">
<span lang="EN" style="font-size: 10.5pt; font-family: Times New Roman">Your job
is to write a program that reads in the number k and the set S and then prints
all possible games choosing numbers only from S.</span></p>

#格式#
##输入格式##
Input will contain one or more test cases.

Each test case consists of one line containing several integers separated from each other by spaces. The first integer on the line will be the number k (6 &lt k &lt 13). Then k integers, specifying the set S, will follow in ascending order.

Input will be terminated by a value of zero (0) for k.

##输出格式##
For each test case, print all possible games, each game on one line.

The numbers of each game have to be sorted in ascending order and separated from each other by exactly one space. The games themselves have to be sorted lexicographically, that means sorted by the lowest number first, then by the second lowest and so on, as demonstrated in the sample output below.

The test cases have to be separated from each other by exactly one blank line. Do not put a blank line after the last test case.

#样例1#
##样例输入1##

7 1 2 3 4 5 6 7
8 1 2 3 5 8 13 21 34
0

##样例输出1##

1 2 3 4 5 6
1 2 3 4 5 7
1 2 3 4 6 7
1 2 3 5 6 7
1 2 4 5 6 7
1 3 4 5 6 7
2 3 4 5 6 7

1 2 3 5 8 13
1 2 3 5 8 21
1 2 3 5 8 34
1 2 3 5 13 21
1 2 3 5 13 34
1 2 3 5 21 34
1 2 3 8 13 21
1 2 3 8 13 34
1 2 3 8 21 34
1 2 3 13 21 34
1 2 5 8 13 21
1 2 5 8 13 34
1 2 5 8 21 34
1 2 5 13 21 34
1 2 8 13 21 34
1 3 5 8 13 21
1 3 5 8 13 34
1 3 5 8 21 34
1 3 5 13 21 34
1 3 8 13 21 34
1 5 8 13 21 34
2 3 5 8 13 21
2 3 5 8 13 34
2 3 5 8 21 34
2 3 5 13 21 34
2 3 8 13 21 34
2 5 8 13 21 34
3 5 8 13 21 34

#限制#
1000ms
32768KB

#提示#

#来源#