#include<bits/stdc++.h>
#define LL __int128
#define N 25
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define Down(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
int m,nv,lim,mx;
LL n,g[N][N*10],pw[N];
LL f[N][N*10],nw,r,p,ans;
inline void print(LL x){if(!x) return;print(x/10),putchar(x%10+'0');}
inline LL dp(int nlen)
{
    LL res=0;
    For(c,0,lim)
    {
        memset(f,0,sizeof(f));
        LL nr=p*c+r;f[m][nr/pw[m]]=1;
        Down(i,m,1) For(j,0,mx) For(k,0,mx)
        {
            int nxt=j*10+nr/pw[i-1]%10-k;
            if(nxt >= 0 && nxt <= mx) 
                f[i-1][nxt]+=f[i][j]*g[nlen/m+(nlen%m>=i)][k];
        }res+=f[0][0];
    }
    return res;
}

int main()
{
    scanf("%d%lld",&m,&n);
    pw[0]=g[0][0]=1,n++;
    For(i,1,20) pw[i]=pw[i-1]*10;
    lim=19/m+1,p=pw[m]-1,mx=(lim+3)*8;
    For(i,0,19) For(j,0,i*8) 
        For(k,0,8) g[i+1][j+k]+=g[i][j];
    Down(i,20,0) 
    {
        for(nv=0;nv<=9;nv++)
            if((nw=dp(i)) >= n) break;
            else n-=nw,r=(r+p-pw[i%m])%p;
        ans+=pw[i]*nv;
    }print(ans/p);
    return 0;
}