from math import factorial

def calc_order(a):
    n = len(a)
    if n == 0:
        return 0
    b = a[1:]
    for i in range(n - 1):
        if b[i] > a[0]:
            b[i] -= 1
    return a[0] * factorial(n - 1) + calc_order(b)

def calc_rev(a):
    n = len(a)
    res = [0] * n
    for i in range(n):
        res[a[i]] = i
    return res

def reproduce(k, n):
    a = [0] * n
    used = [False] * n
    for i in range(n):
        while used[:a[i]].count(False) <= k // factorial(n - i - 1):
            a[i] += 1
        a[i] -= 1
        k %= factorial(n - i - 1)
        used[a[i]] = True
    return a

n, s = map(int, input().split())
print(calc_order(calc_rev(reproduce(n, s))))