n = int(input())  
m = int(input())  
lists = list(map(int, input().split()))  
lists.sort()  
sum = 0  
vis = [1 for i in range(n)]  
ans = [0 for i in range(n)]  
def dfs(num):
    global sum
    if num>n:
        sum += 1
        if sum == 1+m:
            print(' '.join('%d'%o for o in ans),end='')
            return
    else:
        for i in lists:
            if vis[lists.index(i)]:
                if sum == 1+m:
                    return
                vis[lists.index(i)] = 0
                ans[num-1] = i
                dfs(num+1)
                vis[lists.index(i)] = 1
dfs(1)