[Python] 백준 15651번 - N과 M (2)

def combine(n, k):
    results = []

    def dfs(elements, start, k):
        if k==0:
            results.append(elements[:])
        for i in range(start, n+1):
            elements.append(i)
            dfs(elements, i+1, k-1)
            elements.pop()

    dfs([], 1, k)
    return results

N, M = map(int, input().split())
for i in combine(N, M):
    print(*i)