#include <cstdio>
#include <cstring>

using namespace std;
typedef long long ll;

__int128 DP[42][552], p10[42];
int F[251];
int wow[41];

int main()
{
	int k, i, j, a, b, c, d, e, f, B;
	ll n;
	__int128 ans = 0, p = 1, T;
	scanf("%d%lld", &k, &n);
	for(i = 1; i <= k; i++)
		p *= 10;
	p10[0] = 1;
	for(i = 1; i <= 36; i++)
		p10[i] = p10[i - 1] * 10;
	p--;
	B = 36 / k + 1;
	for(i = 0; i < (ll)k * B; i++)
		for(j = 0; j < 9; j++)
		{
			wow[i] = j;
			f = 0;
			for(a = 1; a < B; a++)
			{
				T = p * a;
				memset(DP, 0, sizeof(DP));
				for(b = 0; b < k; b++)
				{
					if(b)
						for(c = 0; c < B; c++)
							DP[b][c * 10 + (T / p10[k - b - 1]) % 10] = DP[b - 1][c];
					else
						DP[0][T / p10[k - 1]] = 1;
					for(c = 0; c < B; c++)
						for(d = 0; d <= 9 * B; d++)
							if(c * k + b <= i)
								DP[b][d] = DP[b][d + wow[c * k + b]];
							else
								for(e = 1; e < 9; e++)
									DP[b][d] += DP[b][d + e]; 
				}
				if(DP[k - 1][0] >= n)
				{
					f = 1;
					break;
				}
				n -= DP[k - 1][0];
			}
			if(f)
				break;
		}
	for(i = 0; i < (ll)k * B; i++)
		ans = 10 * ans + wow[i];
	ans /= p;
	c = 0;
	while(ans)
	{
		F[++c] = ans % 10;
		ans /= 10;
	}
	for(i = c; i >= 1; i--)
		printf("%d", F[i]);
	printf("\n");
	return 0;
}