N,K = map(int, input().split())
N = min(N, 162)
K += 1

# DP
DP = [[[0] * (N+1) for _ in range(10)]]
DP[0][0][0] = 1
for i in range(100_000):
    DP2 = [[0] * (N+1) for _ in range(10)]
    for j in range(10):
        for k in range(N+1):
            for l in range(10):
                if k + l <= N:
                    DP2[l][k+l] = DP[i][j][k] + DP2[l][k+l]
    total_sum = 0
    for j in range(10):
        for k in range(N+1):
            total_sum += DP2[j][k]
    DP.append(DP2)
    if total_sum >= K:
        break

M = len(DP)

# 後で計算しやすいように累積和をしています
for i in range(M):
    for j in range(10):
        for k in range(N):
            DP[i][j][k+1] = DP[i][j][k] + DP[i][j][k+1]

ans = []
# 上の桁から答えを求める
for i in range(M-1, 0, -1):
    for j in range(10):
        if DP[i][j][N] < K:
            K -= DP[i][j][N]
        else:
            ans.append(j)
            N -= j
            break

print("".join(map(str, ans)))