[백준] 15656번 N과 M (7) (파이썬)

def recursion():
    if M == len(picked):
        print (*picked)
        return 

    for i in range(len(numbers)):
        picked.append(numbers[i])
        recursion()
        picked.pop()

if __name__ == "__main__":
    N, M = list(map(int, input().split()))
    numbers = list(map(int, input().split()))
    numbers.sort()
    picked = []
    recursion()