N과M(5)-15654.py

import sys

n_input = sys.stdin.readline

def dfs(N, M, sequence, numbers):

   

    if len(sequence) == M:

        print(*sequence)

        return

    for num in numbers:    

        if num not in sequence:

            dfs(N, M, sequence + [num], numbers)

N, M = map(int, n_input().split())

numbers = list(map(int, n_input().split()))

numbers.sort()

dfs(N, M, [], numbers)