#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using i128 = __int128;
template <typename T> void write(T x) {
	if (x == 0) { putchar('0'); return; }
	if (x < 10) { putchar(x+48); return; } 
	if (x > 9) write(x / 10), putchar(x%10+48);
}
template <typename T> void writeln(T x) { write(x), puts(""); }
const int SZ = 37;
void upd(i128& a, i128 b) { a += b; if (a > 2e18) a = 2e18; }
i128 g[SZ+1][310], dp[2][250], mod, pw[SZ+1];
int K, curg;
i128 dfs(int cur, i64 N, i128 rem) {
	if (cur < 0) return 0;
//	cerr << "! " << cur << " " << N << '\n';
	for (int d = 0; d < 9; d++) {
		i128 all = 0, req = (rem + d * pw[cur]) % mod; req = (mod - req) % mod;
		for (int t = 0; t <= 50; t++) {
			memset(dp, 0, sizeof dp);
			i128 treq = req + t * mod;
			int o = 0; dp[o][0] = 1;
			for (int i = 0; i < K+3; i++) {
				memset(dp[o^1], 0, sizeof dp[o^1]);
				int cnt = cur/K + (cur%K > i); 
				for (int j = 0; j < 200; j++) if (dp[o][j] > 0) {
					for (int k = 0; k <= (i < K ? 200 : 0); k++) if ((k + j) % 10 == treq/pw[i]%10) {
						upd(dp[o^1][(k+j) / 10], dp[o][j] * g[cnt][k]);
					}
				}
				o ^= 1;
			}
			upd(all, dp[o][0]);
//			cerr << "t = " << t << " " << i64(dp[o][0]) << '\n';
			if (all >= N) break;
		}
		if (all >= N) return d * pw[cur] + dfs(cur - 1, N, (rem + d * pw[cur]) % mod);
		else N -= all;
//		cerr << N << '\n';
	}
}
int main() {
//	freopen("B.in", "r", stdin);
	ios::sync_with_stdio(false), cin.tie(nullptr);
	g[0][0] = 1;
	for (int i = 0; i <= SZ; i++) {
		for (int j = 0; j < 310; j++) if (g[i][j]) {
			for (int d = 0; d < 9; d++) if (i+1 <= SZ && j+d < 310)
				upd(g[i+1][j+d], g[i][j]);
		}
	}
//	for (int i = 0; i < 6; i++) {
//		for (int j = 0; j <= 10; j++)
//			cerr << i << " " << j << " " << g[i][j] << '\n';
//	}
	pw[0] = 1; for (int i = 1; i <= SZ; i++) pw[i] = 10 * pw[i-1];
	i64 N; cin >> K >> N, mod = pw[K] - 1, ++N;
	writeln(dfs(SZ, N, 0) / mod);
	return 0;
}