#백준_6603 로또 - Java

# 유형 : 탐색, DFS

# dfs 쉬운 문제중 하나, 인덱스만 잘 설정해서 탐색돌리면 해결가능

 

package bj;
 
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
 
public class p6603_ {
    static int arr[];
    static int cnt=0;
    static int N;
    static boolean visit[];
    static ArrayList<Integer> arrList = new ArrayList<>();
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        N = Integer.parseInt(st.nextToken());
        while(N!=0) {
            arr = new int[N];
            visit = new boolean[N];
            for(int i=0; i<N; i++)
                arr[i] = Integer.parseInt(st.nextToken());
            
            for(int i=0; i<N; i++) {
                arrList.add(arr[i]);
                dfs(i);
                arrList.remove(0);
            }
            st = new StringTokenizer(br.readLine());
            N = Integer.parseInt(st.nextToken());
            System.out.println();
        }
        
    }
    public static void dfs(int index) {
        if(arrList.size() == 6) {
            for(int i=0; i<arrList.size(); i++)
                System.out.print(arrList.get(i)+" ");
            System.out.println();
            return;
        }
        
        
        for(int i=index+1; i<N; i++) {
            arrList.add(arr[i]);
            dfs(i);
            arrList.remove(arrList.size()-1);
        }
    }
}