#include<stdio.h>
#include<algorithm>
using namespace std;
const int MAXN=1e6+7;
struct Node{
	int id,num;
}l[MAXN];
int n,m,ans;
inline int Count(int x)
{
	int sum=0;
	while(x)sum+=x%10,x/=10;
	return sum;
}
inline bool cmp(Node A,Node B)
{
	return A.num==B.num?A.id<B.id:A.num<B.num;
}
int main()
{
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)l[i]={i,Count(i)};
	sort(l+1,l+1+n,cmp);
	printf("%d",l[m].id);
	return 0;
}

def takeSecond(elem):
	return elem[1]
def count(x):
	tmp,sum=x,0
	while tmp>0:
		sum+=tmp%10
		tmp//=10
	return sum
l=[]
n,m=int(input()),int(input())
for i in range(n):
	l.append((i+1,count(i+1)))
l.sort(key=takeSecond)
print(l[m-1][0])