#include <bits/stdc++.h>
#define int long long 
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=20,MOD=1e9+7;
struct INFO {int k,op,sum;}; //op 是否有限制 sum 个数 k 乘积 
map<int,int> f; int a[MAXN],tot,ans,n,k,v[100000];
struct Item {__int128 ziji,chengji;int id;};
bool operator <(Item a,Item b) {return a.chengji<b.chengji;}
signed main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>k;
	int N=n,len=0;
	while(N) a[++len]=N%10,N/=10;
	vector<INFO> vc;
	vc.push_back({1,1,1});
	roff(i,len,1) {
		vector<INFO> nw;
		map<pair<int,int>,int> mp;
		for(auto info:vc) {
			int k=info.k,op=info.op,sum=info.sum;
			if(op) {
				ffor(j,1,a[i]) {
					int K=k*j,OP=op&(j==a[len]);
					if(K<=n) mp[{K,OP}]+=sum;
				}
			}
			else {
				ffor(j,1,9) {
					int K=k*j,Op=0;
					if(K<=n) mp[{K,0}]+=sum;	
				}
			}
		}
		for(auto info:mp) nw.push_back({info.first.first,info.first.second,info.second});
		vc=nw;
	}
	for(auto pr:vc) f[pr.k]+=pr.sum;
	vc.clear();
	vc.push_back({1,0,1});
	ffor(i,1,len-1) {
		vector<INFO> nw;
		map<pair<int,int>,int> mp;
		for(auto info:vc) {
			int k=info.k,op=info.op,sum=info.sum;
			ffor(j,1,9) {
				int K=k*j,Op=0;
				if(K<=n) mp[{K,0}]+=sum;	
			}
		}
		for(auto info:mp) nw.push_back({info.first.first,info.first.second,info.second});
		vc=nw;	
		for(auto pr:vc) f[pr.k]+=pr.sum;
	}
	vector<int> Vc;
	for(auto pr:f) Vc.push_back(pr.second);
	sort(Vc.begin(),Vc.end(),[](int A,int B) {return A>B;});
	for(auto u:Vc) v[++tot]=u;
	priority_queue <Item> q;
	ffor(i,1,tot) q.push({v[i],(__int128)v[i]*v[1],1});
	__int128 ans=0;
	ffor(i,1,k) {
		__int128 chengji=q.top().chengji,ziji=q.top().ziji; int id=q.top().id;
		q.pop(); ans+=chengji;
		if(id!=tot) {
			++id; q.push({ziji,(__int128)ziji*v[id],id});	
		}
	}
	int res=(int)(ans%(1000000000+7));
	cout<<res;
	return 0;
}