#include<iostream>
#include<cstdio>
#define K 20
#define N 26
#define M 1000000
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
__int128 sk,n,op[K+1],c[K+1],dp[K+1][10],DP[K+1][2],dps[N+1][M+1][2],st,d[2],e[2],rst,ans;
void Adder(__int128 &x,__int128 d)
{
    x+=d;
    if (x>=n) x=n;
    return;
}
void dfs(int x)
{
    if (x==K+1)
    {
	for (int i=K-sk;i<=K;++i) DP[i][0]=DP[i][1]=0;
	DP[K-sk][op[K]]=1;
	for (int i=K-sk+1;i<=K;++i)
	    for (int op=0,opt;op<=1;++op)
		for (int j=0,k;j<=9;++j)
		{
		    k=j-op;
		    if (k<0) k+=10,opt=1;
		    else opt=0;
		    if (k!=9) Adder(DP[i][opt],DP[i-1][op]*dp[i][j]);
		}
	Adder(rst,DP[K][0]);
	return;
    }
    __int128 res;
    bool opt;
    for (int i=0;i<=1;++i)
    {
	op[x]=i,opt=0;
	if (x-sk>=1)
	{
	    for (int j=0;j<=9;++j) dp[x][j]=(c[x]==-1)||(c[x]==j);
	    for (int j=0,t,opts;j<=9;++j)
	    {
		res=0;
		for (int k=0;k<=9;++k)
		{
		    t=k-j-op[x-1];
		    if (t<0) t+=10,opts=1;
		    else opts=0;
		    if (opts==i&&t!=9) Adder(res,dp[x-sk][k]);
		}
		dp[x][j]=min(dp[x][j]*res,n);
	    }
	}
	else
	{
	    for (int j=0;j<=9;++j) dp[x][j]=(c[x]==-1)||(c[x]==j);
	    for (int j=0,k,opts;j<=9;++j)
	    {
		k=-j-op[x-1];
		if (k<0) k+=10,opts=1;
		else opts=0;
		if (opts!=i||k==9) dp[x][j]=0;
	    }
	}
	for (int j=0;j<=9;++j) opt|=(dp[x][j]>0);
	if (opt) dfs(x+1);
    }
    return;
}
__int128 solve()
{
    rst=0,dfs(1);
    return rst;
}
void write(__int128 x)
{
    if (!x) return;
    write(x/10),printf("%d",(int)(x%10));
    return;
}
int main()
{
    __int128 res,dst,S=1;
    sk=read(),n=read()+1,res=n;
    if (sk<=5)
    {
	S=1;
	for (int i=1;i<=sk;++i) S*=10;
	dps[0][0][0]=1;
	for (int i=1;i<=N;++i)
	    for (int j=0,k;j<S;++j)
		for (int op=0,opt;op<=1;++op)
		    if (dps[i-1][j][op])
			for (int t=0;t<=9;++t)
			{
			    k=j/(S/10)-t-op;
			    if (k<0) k+=10,opt=1;
			    else opt=0;
			    if (k!=9) Adder(dps[i][(j*10+t)%S][opt],dps[i-1][j][op]);
			}
	st=0,d[0]=1,d[1]=0,res=n;
	for (int i=N;i>=1;--i)
	{
	    for (int j=0,k;j<=9;++j)
	    {
		rst=0;
		for (int op=0,opt;op<=1;++op)
		{
		    k=j-st%10-op;
		    if (k<0) k+=10,opt=1;
		    else opt=0;
		    if (k!=9) Adder(rst,d[opt]*dps[i-1][st/10+j*(S/10)][op]);
		}
		if (res<=rst)
		{
		    e[0]=e[1]=0;
		    for (int op=0,opt;op<=1;++op)
		    {
			k=j-st%10-op;
			if (k<0) k+=10,opt=1;
			else opt=0;
		        if (k!=9) Adder(e[op],d[opt]);
		    }
		    st=st/10+j*(S/10);
		    if (i>sk) ans=ans*10+j;
		    d[0]=e[0],d[1]=e[1];
		    break;
		}
		res-=rst;
	    }
	}
	write(ans),puts("");
    }
    else
    {
	for (int i=1;i<=K;++i) c[i]=-1;
	for (int i=K;i>=1;--i)
	    for (int j=0;j<=9;++j)
	    {
		c[i]=j,dst=solve();
		if (res<=dst) break;
		else res-=dst;
	    }
	for (int i=K;i>=1;--i) ans=ans*10+c[i];
	write(ans),puts("");
    }
    return 0;
}