N,K=map(int,input().split())
if N>=200:
	print(K)
	exit()
K+=1
dp=[[0]*(N+10) for i in range(100001)]
dp[0][0]=1
for i in range(100000):
	for j in range(N+1):
		dp[i][j]=min(dp[i][j],K+1)
		for k in range(10):
			dp[i+1][j+k]+=dp[i][j]
ans=[]
cnt=0
sm=0
for i in range(100000,-1,-1):
	for j in range(N):
		dp[i][j+1]+=dp[i][j]
	for j in range(min(10,N-sm+1)):
		if K<=cnt+dp[i][N-sm-j]:
			if len(ans)!=0 or j!=0:
				ans.append(str(j))
			sm+=j
			break
		else:
			cnt+=dp[i][N-sm-j]
print("".join(ans))