#include<bits/stdc++.h>
#define int __int128
#define LL long long
using namespace std;
const int Inf=1e18+1;
inline int read()
{
	int sum=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}
	while(isdigit(ch)){sum=sum*10+ch-48;ch=getchar();}
	return sum*f;
}
int f[51][101];
int Ans[55];
int n,K,d;
int T,t;
int s[55];
int settled[55];
int unset[55];
int bs[55][505];
bool put;
void init()
{
	bs[0][0]=1;
	for(int i=1;i<=36;i++)
		for(int j=0;j<=100;j++)
		{
			for(int k=0;k<=min((int)8,j);k++)
			{
				if(bs[i][j]>1e18)break;
				bs[i][j]+=bs[i-1][j-k];
			}
			if(bs[i][j]>Inf) bs[i][j]=Inf;
		}
			
				
}
bool CH=0;
int dp()
{
	memset(f,0,sizeof(f));
	f[0][0]=1;
	for(int i=1;i<=d+1;i++)
	{
		for(int j=0;j<=10;j++)
		{
			for(int to=0;to<=100;to++)
			{
				if((j+to+settled[i-1])%10!=s[i-1]) continue;
				f[i][(to+j+settled[i-1])/10]+=f[i-1][j]*bs[unset[i-1]][to];
			}
		}
	}
	if(d==-1)
	{
		if(!puts) return 1;
		return 0;
	}
	return f[d+1][0];
}
int count()
{
	int ssum=0;
	for(int p=0;p<=20;p++)
	{
		memset(s,0,sizeof(s));
		t=T*p; 
		d=0;
		while(t)
		{
			s[d]=t%10;
			d++;
			t/=10;
		}
		d--;
		int sum=dp();
		ssum+=sum;
		if(ssum>Inf) return ssum;
	}
	return ssum; 
}
void write(int x)
{
	if(x)
	{
		write(x/10);
		putchar(x%10+48);
	}
}
signed main()
{
	init();
	K=read(),n=read();
	T=1;for(int g=1;g<=K;g++) T*=10;T--;
	for(int i=0;i<=37;i++) unset[i%K]++;
	for(int i=37;i>=0;i--)
	{
		unset[i%K]--;
		for(int j=0;j<9;j++)
		{
			settled[i%K]+=j;
			if(i==2&&j==0) CH=1;
			int g=count();
			if(g>=n){put|=(j>0);Ans[i]=j;break;}
			else n-=count(),settled[i%K]-=j;
		}
	}
	bool flgg=0;
	int TTT=0;
	for(int i=37;i>=0;i--)
	{
		TTT=TTT*10+Ans[i];
	}
	write(TTT/T);
	return 0;
}