//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll thres=1000000000000000005ll;
int k;
ll n;
void update(ll &a,ll b)
{
	a+=b;
	a=min(a,thres);
}
ll mul(ll x,ll y)
{
	if(!x||!y) return 0;
	if(y>thres/x) return thres;
	return x*y;
}
ll dp[44][44*8];
longer pw10[39];
void print(longer x)
{
	if(x>=10)
		print(x/10);
	cout<<(int)(x%10);
}
int main()
{
	//freopen("qiang.in","r",stdin);
	//freopen("qiang.out","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>k>>n;
	n++;
	dp[0][0]=1;
	for(int i=1;i<44;i++)
		for(int j=0;j<44*8;j++)
			for(int x=0;x<9&&x<=j;x++)
				update(dp[i][j],dp[i-1][j-x]);
	pw10[0]=1;
	for(int i=1;i<39;i++)
		pw10[i]=pw10[i-1]*10;
	longer ans=0;
	longer cur=0;
	longer val=pw10[k]-1;
	for(int i=40;i>=0;i--)
	{
		for(int j=0;j<9;j++)
		{
			ll cnt=0;
			longer need=(val-cur%val)%val;
			for(longer real=need;real<=pw10[k]*42*8;real+=val)
			{
				ll f[25][44];
				memset(f,0,sizeof(f));
				f[0][0]=1;
				for(int x=1;x<=24;x++)
				{
					int have=0;
					if(x<=k&&i>=x)
						have=(i-x+k)/k;
					int realvalue=(real/pw10[x-1])%10;
					for(int y=0;y<44;y++)
						for(int z=0;z<=have*8;z++) if((y+z)%10==realvalue)
							update(f[x][(y+z)/10],mul(f[x-1][y],dp[have][z]));
				}
				update(cnt,f[24][0]);
			}
			if(cnt>=n)
			{
				ans=ans*10+j;
				break;
			}
			n-=cnt;
			cur+=pw10[i%k];
		}
	}
	print(ans/val);
	return 0;
}