#include <bits/stdc++.h>
using namespace std;
#define N 222222
#define LL long long
#define mod 1000000007
LL read(){
    LL x=0,f=1;
    char ch=getchar();
    while (ch<'0' || ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while (ch>='0' && ch<='9'){
        x=x*10+ch-'0';ch=getchar();
    }
    return x*f;
}
struct pt{
    int x,y;
    LL val;
    inline bool operator < (const pt &a) const {
        return val<a.val;
    }
};
int tot,cnt,len,m;
LL n,k,ans;
int a[15],num[N];
LL b[N*10],dp[15][N][2],siz[N];
priority_queue <pt> q;
pt makept(int x,int y){
    pt res;
    res.x=x;res.y=y;
    res.val=1LL*siz[num[x]]*siz[num[y]];
    return res;
}
inline void dfs(int lst,int t,LL sum){
    if (sum==0) return;
    if (t>len){
        b[++cnt]=sum;
        return;
    }
    for (int i=lst;i<=9;++i){
        dfs(i,t+1,sum*i);
    }
}
inline bool cmp(const int x,const int y){
    return siz[x]>siz[y];
}
int main(){
    LL n=read(),k=read();
    while (n){
        a[++len]=n%10;n/=10;
    }
    dfs(0,0,1);
    sort(b+1,b+1+cnt);
    cnt=unique(b+1,b+1+cnt)-b-1;
    dp[0][2][0]=1;
    for (int i=0;i<=len;++i){
        for (int j=1;j<=cnt;++j){
            for (int k=0;k<=1;++k){
                if (!dp[i][j][k]) continue;
                for (int p=1;p<=9;++p){
                    (dp[i+1][lower_bound(b+1,b+1+cnt,b[j]*p)-b][k+p>a[i+1]]+=dp[i][j][k])%=mod;
                }
            }
        }
    }
    for (int j=1;j<=cnt;++j){
        num[j]=j;
        for (int i=1;i<len;++i){
            siz[j]+=dp[i][j][1]+dp[i][j][0];
        }
        siz[j]+=dp[len][j][0];
    }
    sort(num+2,num+1+cnt,cmp);
    q.push(makept(2,2));
    while (!q.empty()){
        pt tmp=q.top();q.pop();
        int x=tmp.x,y=tmp.y;
        LL val=tmp.val;
        ans=(ans+val)%mod;
        m++;if (m==k) break;
        if (x!=y){
            ans=(ans+val)%mod;
            q.push(makept(x+1,y));
            m++;if (m==k) break;
        }
        if (x==2) q.push(makept(x,y+1));
    }
    cout<<ans<<endl;
}