#include<bits/stdc++.h>
typedef __int128 ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
ll k,n,d,ans,a[105],p[105],res,f[500],g[500];
void solve(){
	rep(i,1,36/k){ 
		ll sum=d*i;//枚举 k 位一分段的和
		memset(f,0,sizeof(f));
		f[0]=1;
		rep(j,0,k-1){
			for(ll p=j;p<37;p+=k){
				memset(g,0,sizeof(g));
				rep(o,0,8){
					if(a[p]==-1||a[p]==o){
						rep(z,o,300)g[z]+=f[z-o];
					}
				}
				swap(f,g);
			}
			memset(g,0,sizeof(g));
			rep(o,0,30)g[o]+=f[o*10+sum%10]; 
			swap(f,g);
			sum/=10;
		}
		res+=f[sum];
	}
}
int main(){
	k=read(),n=read();
	d=1;
	rep(i,1,k)d*=10;
	p[0]=1;
	rep(i,1,36)p[i]=p[i-1]*10;
	d--;
	rep(i,0,36)a[i]=-1;
	per(i,36,0){
		a[i]=0;
		ans*=10;
		rep(j,0,8){
			a[i]=j,res=0;
			solve();
			if(res<n)n-=res;
			else break;
			ans++;
		}
	}
	write(ans/d);
	return 0;
}