#include <bits/stdc++.h>
#define int __int128
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
template <typename T> void write(T x) {
	if (x < 0) { putchar('-'); x *= -1; }
	if (x > 9) write(x / 10);
	putchar(x % 10 + 48);
}
template <typename T> void writes(T x) { write(x); putchar(32); }
template <typename T> void writeln(T x) { write(x); puts(""); }
const int N = 45;
int k, n, pw[N], a[N], s[N], t[N], f[N][N], g[N][N * 10];
int calc(int pos) {
	ms(s, 0); ms(t, 0);
	F(i, pos + 1, 37) t[i % k] += a[i];
	F(i, 0, pos) s[i % k]++;
	int sum = 0;
	F(i, 1, 30) {
		// i = 1;
		int ans = i * (pw[k] - 1);
		// writeln(ans);
		ms(f, 0);
		f[0][0] = 1;
		F(j, 0, k - 1) {
			// writes(ans % 10); writes(t[j]), writeln(s[j]);
			F(tt, 0, 40)
				F(l, 0, s[j] * 8)
					if ((tt + l + t[j]) % 10 == ans % 10) {
						// if (tt == 0 && l == 8) {
						// 	writes(f[j][tt]), writeln(g[s[j]][l]);
						// 	cout << " -> ", writeln((tt + l + t[j]) / 10);
						// }
						f[j + 1][(tt + l + t[j]) / 10] += f[j][tt] * g[s[j]][l];//, writes(s[j]), writes(l), writeln(g[s[j]][l]);
					}
			ans /= 10;
		}
		// writeln(ans);
		// puts("!!!");
		// writeln(f[k][ans]);
		// exit(0);
		sum += f[k][ans];
		if (sum > n) return n;
	} return sum;
}
signed main() {
	read(k); read(n);
	pw[0] = 1;
	F(i, 1, 37) pw[i] = pw[i - 1] * 10;
	g[0][0] = 1;
	F(i, 1, 37)
		F(j, 0, (i - 1) * 8)
			F(k, 0, 8)
				g[i][j + k] += g[i - 1][j];
	// writeln(g[2][5]);
	// a[1] = 1;
	// writeln(calc(0));
	// return 0;
	DF(i, 37, 0) {
		F(j, 0, 8) {
			a[i] = j;
			int s = calc(i - 1);
			if (s < n) n -= s;
			else break;
		}
	} int sum = 0;
	F(i, 0, 37) sum += pw[i] * a[i];
	write(sum / (pw[k] - 1));
	return 0;
}