#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1000010;
int n, m;
int w[N], s[N];
bool cmp(int a, int b)
{
if (s[a] != s[b]) return s[a] < s[b];
return a < b;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++)
{
w[i] = i;
for (int j = i; j; j /= 10)
s[i] += j % 10;
}
nth_element(w + 1, w + m, w + n + 1, cmp);
cout << w[m] << endl;
return 0;
}