import sys

f = [[0], [0, 1]]

for n in range(2, 55):
    f.append([])
    for i in range(0, n + 1):
        sum = 0
        for k in range(n - i, n):
            sum = sum + f[n - 1][k]
        f[n].append(sum)

pow = [1]
for n in range(1, 55):
    pow.append(pow[n - 1] * n)

inp = sys.stdin.readline().split(' ')
n, k = int(inp[0]), int(inp[1])

perm = []
for p in range(n):
    i = 1
    while True:
        if i > n - p:
            print(-1)
            exit(0)
        tmp = pow[n - p - 1] // pow[n - p - i] // pow[i - 1] * f[i][1] * f[n - p - i + 1][1]
        if (tmp < k):
            k = k - tmp
            i = i + 1
        else:
            break
    perm.append(i - 1)

rem = list(range(1, n + 1))
output = []

for p in range(n):
    q = rem[perm[p]]
    output.append(q)
    rem.remove(q)
    print(q, end='')
    if (p == n - 1):
        print('')
    else:
        print(' ', end='')