파이썬 15649번 파이썬 (백트레킹 by dfs)

def dfs():

    if len(arr)== m:

        print(" ".join(map(str, arr)))

        return

    for i in range(1,n+1):

        if i in arr:

            continue

        arr.append(i)

        dfs()

        arr.pop()

n,m = map(int,input().split())

arr=[]

dfs()