#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<vector>
#include<ctime>
#include<cstring>
#include<map>
#include<cmath>
#include<queue>
#define mp make_pair
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define int __int128

// #define int long long
using namespace std;
inline int read(){
	int x=0,f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return f==-1?~x+1:x;
}
int k,n;
int M;
int pw[2000];
int digs[25][1010];
int dp[25][1010];
const int B=22;
void print(int x){
	if(x<0) putchar('-') ,x=~x+1;
	if(x>=10) print(x/10);
	putchar(x%10+'0');
}
int calc(int pre,int len){
	// print(pre);putchar(' ');print(len);putchar('\n');
	pre=(M-pre)%M;
	int ret=0;
	for(int _=0;_<B;++_){
		int tar=_*M+pre;
		memset(dp,0,sizeof(dp));
		dp[0][0]=1;
		for(int j=0;j<k;++j){
			int cnt=len/k+(len%k>j);
			// print(cnt);putchar('\n');
			int dig=tar/pw[j]%10;
			for(int s=0;s<=B;++s) if(dp[j][s]){
				for(int l=0;l<=B;++l){
					int p=l*10+dig-s;
					if(p>=0&&p<=8*cnt){
						dp[j+1][l]+=dp[j][s]*digs[cnt][p];
					}
				}
			}
		}
		ret+=dp[k][tar/pw[k]];
	}
	// if(len==0) exit(0);
	// print(ret);putchar('\n');
	return ret;
}
signed main(){
	k=read(),n=read();
	pw[0]=1;
	for(int i=1;i<=k;++i) pw[i]=pw[i-1]*10;
	M=pw[k]-1;
	int ans=0,pre=0;
	digs[0][0]=1;
	for(int i=1;i<=B;++i){
		for(int j=0;j<=i*8;++j){
			for(int k=0;k<9&&k<=j;++k) digs[i][j]+=digs[i-1][j-k];
		}
	}
	bool fl=0;
	for(int i=(20/k+2)*k-1;~i;--i){
		// print(i);printf("---------\n");
		int j;
		for(j=0;j<9;++j){
			int cnt=calc(pre,i);
			// print(j);putchar(' ');print(cnt);putchar('\n');
			// printf("j:%d,cnt:%lld\n",j,cnt);
			if(cnt>n){
				ans=ans*10+j;
				break ;
			}
			n-=cnt;
			(pre+=pw[i%k])%=M;
		}
		// pre=pre*10%M;
		if(ans>=M||fl){
			putchar(ans/M+'0');ans%=M;fl=1;
		}
	}return 0;
}