#include <bits/stdc++.h>
using namespace std;
int k[1000010];
bool cmp(int a,int b)
{
return k[a]==k[b]?a<b:k[a]<k[b];
}
int main()
{
int n,m;
cin>>n>>m;
vector <int> a;
for(int i=1;i<=n;i++)
{
a.push_back(i);
int l = i,s = 0;
while(l) k[i]+=l%10,l/=10;
}
sort(a.begin(),a.end(),cmp);
cout<<a[m-1]<<endl;
return 0;
}