BFS& DFS2 | 백준 N과 M

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

def get_seq(level,seq):
	if level==M: ##탈출조건
    	print(''.join(list(map(str,seq))))
        return
        
    for i in range(1, N+1):
    	if i not in seq:
        	temp= seq.copy()
            temp.append(i)
            get_seq(level+1, temp)
         
get_seq(0,[])