import sys

sys.set_int_max_str_digits(10**7)

n, K = map(int, input().split())

if K == 1:
    print(1)
    exit()

now = [1]
dp = [now]
while sum(now) <= K:
    le = len(now)
    nex = [0] * (le + 9)
    for i in range(le):
        for j in range(10):
            nex[i + j] += now[i]

    now = nex[:]
    if len(now) > n + 1:
        now = now[: n + 1]

    dp.append(now)

le = len(dp)
ma = len(dp[-1])
for i in range(le):
    dp[i] += [0] * (ma - len(dp[i]))
    for j in range(len(dp[i]) - 1):
        dp[i][j + 1] += dp[i][j]

ans = 0
for i in range(le - 2, -1, -1):
    for j in range(10):
        if dp[i][n - j] > K:
            ans = 10 * ans + j
            n -= j
            break
        K -= dp[i][n - j]

print(ans)