#include <bits/stdc++.h>

using namespace std;

const int N = 36;

#define int __int128

int f[N][N * 10];

void pre()
{
	f[0][0] = 1;
	for (int i = 0; i + 1 < N; i++) 
		for (int j = 0; j < N * 8; j++)
			if (f[i][j]) for (int k = 0; k <= 8; k++)
				assert(j + k < N * 8), f[i + 1][j + k] += f[i][j];
}

long long k, sz[N];
int pw[N];
long long x;

bool vis[N][N * 10];
int dp[N][N * 10];

int dfs(int tar, int cur, int c)
{
//	printf("dfs(%lld, %lld, %lld)\n", tar, cur, c);
	if (cur >= k) return c == tar;
	if (vis[cur][c]) return dp[cur][c];
	vis[cur][c] = true, dp[cur][c] = 0;
	for (int j = 0; j < N * 8; j++)
	{
		if (!f[sz[cur]][j] || (c + j) % 10 != tar % 10) continue;
//		printf("put %lld:\n", j);
		dp[cur][c] += f[sz[cur]][j] * dfs(tar / 10, cur + 1, (c + j) / 10);
	}
//	printf("dfs(%lld, %lld, %lld) = %lld\n", tar, cur, c, dp[cur][c]);
	return dp[cur][c];
}

signed main()
{
	cin >> k >> x; x++;
	pre();
	for (int i = 0; i <= N - 1; i++) sz[i % k]++;
	pw[0] = 1; for (int i = 1; i < N; i++) pw[i] = pw[i - 1] * 10;
	vector<int> sol;
	int cur = 0;
	for (int i = N - 1; i >= 0; i--)
	{
		for (int j = 0; ; j++)
		{
			assert(j <= 8);
			cur += j * pw[i % k], sz[i % k]--;
//			printf("i = %lld, j = %lld\n", i, j);
			int c = 0;
			for (int p = 0; p < N; p++)
			{
				int tar = p * (pw[k] - 1) - cur;
				if (tar < 0) continue;
				memset(vis, 0, sizeof vis);
				c += dfs(tar, 0, 0);
			}
//			printf("c = %lld\n", c);
			if (x <= c)
			{
				sol.push_back(j);
				break;
			}
			else x -= c, sz[i % k]++, cur -= j * pw[i % k];
		}
	}
	int tmp = 0; for (int x : sol) tmp = tmp * 10 + x;
//	cout << tmp << ' ' << (pw[k] - 1) << endl;
	cout << (long long)(tmp / (pw[k] - 1));
}