#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x) true
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define INF 1e8
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

const LL mod = 1e9+7;
int dp[2][20010];

int main()
{
	ios_init();
	string s;
	cin >> s;
	int m;
	cin >> m;
	int cnt0 = 0;
	REP(i,SZ(s)){
		if(s[i] == '0'){
			cnt0++;
			bool cr = (i+1)&1;
			fill(dp[cr],dp[cr]+m,0);
			bool pr =!cr;
			FOR(j,0,m){
				dp[cr][j] += dp[pr][j];
				dp[cr][j] %= mod;
				dp[cr][(j*10)%m] += dp[pr][j];
				dp[cr][(j*10)%m] %= mod;
			}
		}else{
			int n = s[i]-'0';
			bool cr = (i+1)&1;
			fill(dp[cr],dp[cr]+m,0);
			bool pr = !cr;
			dp[cr][n%m]++;
			REP(j,m){
				dp[cr][j] += dp[pr][j];
				dp[cr][j] %= mod;
				dp[cr][(j*10+n)%m] += dp[pr][j];
				dp[cr][(j*10+n)%m] %= mod;
			}
		}
		//pite(dp[(i+1)&1],dp[(i+1)&1]+m);
	}
	cout << dp[SZ(s)&1][0]+cnt0 << endl;	
	return 0;
}