#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int con=38;
const int mxn=342;
ll n;int K,m,i,j,t,k,s;
ll f[20][mxn],ans[con+2];
bool ok[con+2];

int main()
{
	scanf("%d%llu",&K,&n);
	ll di=0;
	for (i=1;i<=K;++i) di=di*10ll+9;
	/*for (i=0;i<=con/K;++i)
	{
		ok[i]=1;
		ll nw=di*i;
		while (nw>0) ok[i]&=(nw%10!=9),nw/=10;
		//if (!ok[i]) printf("%d ",i);
	}//puts("");*/
	
	for (i=con;i>0;--i)
	{
		for (j=0;j<9;++j)
		{
			if (j==8) {ans[i]=8;break;}
			ll sum=0;
			for (int l=1;l<=con/K;++l)
			// if (ok[l])
			{
				memset(f,0,sizeof(f));
				f[0][0]=1;
				int now=0;
				for (k=1;k<=K;++k)
				{
					for (t=now%10;t<mxn;t+=10)
					 f[k][t/10]=f[k-1][t];
					now=(now/10+9*l);
					int sm=0;
					for (int w=k;w<=con;w+=K)
					{
						if (w>=i)
						{
							sm+=(w==i?j:ans[w]);
						}
						else
						{
							for (t=1;t<mxn;++t) f[k][t]+=f[k][t-1];
							for (t=mxn-1;t>8;--t) f[k][t]-=f[k][t-9];
							for (t=0;t<mxn;++t) f[k][t]=min(f[k][t],n+1);
						}
					}
					if (sm)
					{
						for (t=mxn-1;t>=0;--t) f[k][t]=(t>=sm?f[k][t-sm]:0);
					}
					/*if (i==4&&l==1)
					{
						for (t=0;t<20;++t) printf("%lld ",f[k][t]);puts("");
					}*/
				}
				if (now<mxn)
				{
					//if (f[K][now]&&i<=4) printf("aoao %d %d %lld\n",l,now,f[K][now]);
					sum+=f[K][now];
					if (sum>n) break;
				}
			}
			//if (i<=4){printf("%d %d %lld\n",i,j,sum);}
			if (sum>=n) {ans[i]=j;break;}
			n-=sum;
		}
	}
	bool flg=0;
	ll now=0;
	//for (i=con;i>0;--i) if (ans[i]) break;
	//for (;i>0;--i) putchar(ans[i]+'0');puts("");
	for (i=con;i>0;--i)
	{
		now=now*10ll+ans[i];
		if (flg) putchar(now/di+'0'),now%=di;
		else
		{
			if (now>=di)
			{
				putchar(now/di+'0');now%=di;flg=1;
			}
		}
	}
	if (!flg) putchar('0');
	puts("");
	return 0;
}