#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
template<typename T> inline void chmax(T &_a, const T &_b){ (_b>_a) ? (_a=_b) : (_a); }
template<typename T> inline void chmin(T &_a, const T &_b){ (_b<_a) ? (_a=_b) : (_a); }

int k; ll n;

inline void uadd(ll &a, const ll &b){ a += b; if(a >= INF) a = INF; }
inline ll add(const ll &a, const ll &b){ return (a + b >= INF) ? INF : (a + b); }
inline ll mul(const ll &a, const ll &b){ if(a > INF / b) return INF; else return a * b; }
ll dp[20][500];
int ans[100];
ll f[100][1010];

ll calc(int lvl){
	int lmt = (50 / k);
	ll ret = 0;
	for(int cc = 1; cc <= lmt; ++cc){
		int x[100];
		{
			__int128 tmp = 1;
			rep(i, k) tmp *= 10;
			--tmp;
			tmp *= cc;
			rep(i, k) x[i] = (int)(tmp % 10), tmp /= 10;
			x[k] = (int)(tmp);
		}
		memset(dp, 0, sizeof(dp));
		dp[0][0] = 1;
		rep(i, k){
			int sum = 0, cnt = 0;
			for(int j = i; j <= 50; j += k){
				if(j >= lvl) sum += ans[j];
				else ++cnt;
			}
			for(int pre = 0; pre <= lmt; ++pre) for(int nxt = 0; nxt <= lmt; ++nxt){
				int targ = nxt * 10 + x[i] - pre - sum;
				if(targ < 0 || targ > cnt * 8) continue;
				uadd(dp[i + 1][nxt], mul(dp[i][pre], f[cnt][targ]));
			}
		}
		//cout << "  " << cc << ": " << x[k] << ": " << dp[k][x[k]] << "\n";
		uadd(ret, dp[k][x[k]]);
	}
	return ret;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	f[0][0] = 1;
	for(int i = 0; i <= 50; ++i) for(int j = 0; j <= 8 * i; ++j) rep(x, 9)
		uadd(f[i + 1][j + x], f[i][j]);

	cin >> k >> n;

	memset(ans, -1, sizeof(ans));
	for(int i = 50; i >= 0; --i){
		for(int x = 0; x <= 8; ++x){
			ans[i] = x;
			ll ret = calc(i);
			if(ret >= n) break;
			else n -= ret;
		}
		//cout << i << ": " << ans[i] << endl;
	}
	
	//for(int i = 50; i >= 0; --i) cout << ans[i];
	//cout << "\n";

	ll div = 1; rep(i, k) div *= 10; --div;
	vi res; __int128 rem = 0;
	bool has = 0;
	for(int i = 50; i >= 0; --i){
		rem = rem * 10 + ans[i];
		if(rem >= div) has = 1;
		if(has) cout << (int)(rem / div);
		rem %= div;
	}
	assert(rem == 0);
	cout << "\n";

	return 0;
}