Files
PS/boj/15650.py
Gyubin Han 2600340c03 first commit
from old repository to a new repository
2024-04-30 16:59:10 +09:00

18 lines
272 B
Python

n,m=map(int,input().split())
arr=[]
ch=[0]*(n+1)
def bt(s):
if len(arr)==m:
print(*arr)
return
for i in range(s,n+1):
if ch[i]==1:
continue
arr.append(i)
ch[i]=1
bt(i)
ch[arr.pop()]=0
bt(1)