def display():	
	for i in range(1, n + 1):
		fout.write(str(arr[i]) + " ")		
	fout.write("\n")

def perm(k):
    if k == n + 1:
       display()
    else:
    	for i in range(1, 4):
    	    if not vis[i]:
    	       vis[i] = True
    	       arr[k] = i
    	       perm(k+1)    	       
    	       vis[i] = False
             
 
def solve():
	global vis, arr, n, fout
	fin = open("permutari.in", "r")
	fout = open("permutari.out", "w")	
	n = 3
	arr = [0] * (n+1)
	vis = [False] * (n + 1)	
	perm(1)
solve()