#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

vector<pair<int,int>> v;
vector<int> v1;
int n,m;

bool cmp(pair<int,int> a,pair<int,int> b)
{
    if(a.first != b.first) return a.first < b.first;
    else return a.second < b.second;
}

int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i ++)
    {
        int tmp = i;
        int isum = 0;
        while(tmp)
        {
            isum += tmp % 10;
            tmp /= 10;
        }
        v.push_back({isum,i});
    }
    sort(v.begin(),v.end(),cmp);
    for(auto c : v)
    {
       v1.push_back({c.second});
    }
    cout << v1[m - 1] << endl;
    return 0;

}