#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef __uint128_t LL; 
typedef pair<int,int> pr;
const int mod=998244353;
ll n;
int m;
LL f[45][405],g[45][405],pw[45]={1};
int floor_div(int x,int y){
	if(x<0)return (x-y+1)/y;
	return x/y;
}
int main(){
	cin>>m>>n,n++,g[0][0]=1;
	for(ll i=1;i<=38;i++){
		for(ll j=0;j<=i*8;j++)for(ll k=0;k<=j&&k<=8;k++)g[i][j]+=g[i-1][j-k];
	}
	LL t=1;
	for(ll i=1;i<=m;i++)t*=10;
	t--;
	for(ll i=1;i<=38;i++)pw[i]=pw[i-1]*10;
	LL ans=0,rem=0;
	for(int i=38;i>=0;i--){
		ll x;
		for(x=0;x<=9;x++){
			rem=(ans*10+x)%t*(pw[i]%t)%t,rem=(t-rem)%t;
			//cout<<(ll)rem<<'\n';
			ll cnt[45]={0},all=0;
			for(ll j=0;j<i;j++)cnt[j%m]++;
			for(ll j=0;j<=floor_div(i-1,m)+1;j++){
				LL sum=rem+j*t,dig[45]={0},ts=0;
				while(sum)dig[++ts]=sum%10,sum/=10;
				memset(f,0,sizeof(f)),f[0][0]=1;
				for(ll k=0;k<ts;k++){
					for(ll l=0;l<i*8;l++){
						for(ll p=0;p<=cnt[k]*8;p++){
							if((l+p)%10!=dig[k+1])continue;
							f[k+1][(l+p)/10]+=f[k][l]*g[cnt[k]][p];
						}
					}
				}
				all+=f[ts][0];
			}
			if(n>all)n-=all;
			else break;
		}
		//cout<<i<<'\n';
		ans=ans*10+x;
		//cout<<i<<' '<<(ll)ans<<' '<<(ll)t<<'\n';
	}
	assert(ans%t==0);
	cout<<(ll)(ans/t);
}