// Author: kyEEcccccc

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using ULL = unsigned long long;
using LLL = __int128;

#define F(i, l, r) for (int i = (l); i <= (r); ++i)
#define FF(i, r, l) for (int i = (r); i >= (l); --i)
#define MAX(a, b) ((a) = max(a, b))
#define MIN(a, b) ((a) = min(a, b))
#define SZ(a) ((int)((a).size()) - 1)

constexpr int K = 18;
constexpr LLL LIM = 1000000000000000001;

int k;
LL n;

LLL pw10[39], mod;
LLL g[23][300], f[K + 8][20];

LLL calc(int l, LLL s)
{
	vector<int> dig;
	while (s) dig.push_back(s % 10), s /= 10;
	memset(f, 0, sizeof (f));
	f[0][0] = 1;
	F(i, 0, SZ(dig))
	{
		int tot = i >= k ? 0 : (l + k - 1 - i) / k;
		F(j, 0, 19) F(t, 0, tot * 8)
		{
			if ((j + t) % 10 != dig[i]) continue;
			f[i + 1][(j + t) / 10] += f[i][j] * g[tot][t];
			if (f[i + 1][(j + t) / 10] > LIM) f[i + 1][(j + t) / 10] = LIM;
		}
	}
	return f[SZ(dig) + 1][0];
}

LLL solve(int l, LL rem)
{
	if (l == -1) return 0;
	F(x, 0, 8)
	{
		LLL cnt = 0;
		for (LLL s = (mod - (rem + x * pw10[l]) % mod) % mod; s <= (l / k + 1) * mod; s += mod)
		{
			cnt += calc(l, s);
			if (cnt > LIM) { cnt = LIM; break; }
		}
		// cerr << x << ' ' << (LL)cnt << '\n';
		if (cnt >= n) return solve(l - 1, (rem + x * pw10[l]) % mod) + x * pw10[l];
		n -= cnt;
	}
	assert(0);
}

signed main(void)
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0), cin.tie(nullptr);

	pw10[0] = 1;
	F(i, 1, 38) pw10[i] = pw10[i - 1] * 10;

	g[0][0] = 1;
	F(i, 1, 21)
	{
		F(x, 0, 8)
		{
			F(j, x, i * 8)
			{
				g[i][j] += g[i - 1][j - x];
				if (g[i][j] > LIM) g[i][j] = LIM;
			}
		}
	}

	cin >> k >> n;
	++n;
	mod = pw10[k] - 1;

	LLL res = solve(k + 19, 0);
	assert(res % mod == 0);
	res /= mod;

	vector<int> dig;
	while (res) dig.push_back(res % 10), res /= 10;
	FF(i, SZ(dig), 0) cout << dig[i];
	
	return 0;
}