$ C++ $
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e6 + 10;
int n, m;
struct qwe
{
int dig, val;
}a[N];
bool cmp(qwe a, qwe b)
{
if (a.dig == b.dig) return a.val < b.val;
return a.dig < b.dig;
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
{
a[i].val = i;
int t = a[i].val;
while (t)
{
a[i].dig += t % 10;
t /= 10;
}
}
sort(a + 1, a + n + 1, cmp);
cout << a[m].val << endl;
return 0;
}