n = int(input())
m = int(input())
a = list(map(int, input().split()))
path = [0] * 100010
st = [0] * 100010

flag = 0
def dfs(u):
    global flag
    if u == n:
        flag += 1
        if flag == m + 1:
            print(' '.join(map(str, path[:n])))
            exit()
        return
        
    i = 1
    while i <= n:
        if flag == 0:
            i = a[u]
        if not st[i]:
            path[u] = i
            st[i] = 1
            dfs(u + 1)
            st[i] = 0
        i += 1
            
dfs(0)