#include <bits/stdc++.h>
using namespace std;
 
using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned int;
using vi  = vector<int>; using vb  = vector<bool>; using vd  = vector<double>; using vl  = vector<ll>;
using vvi = vector<vi>;  using vvb = vector<vb>;   using vvd = vector<vd>;     using vvl = vector<vl>;
 
#define REP(i,n) for(ll i=0; i<(n); ++i)
#define FOR(i,b,n) for(ll i=(b); i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define TEN(x) ((ll)1e##x)
 
template<typename T> inline string join(const vector<T>& vec, string sep = " ") { stringstream ss; REP(i, vec.size()) ss << vec[i] << ( i+1 == vec.size() ? "" : sep ); return ss.str(); }

int main() {
#ifdef INPUT_FROM_FILE
	ifstream cin("sample.in");
	ofstream cout("sample.out");
#endif
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(30);
	string s; ll m; cin >> s >> m;

	ll mod = TEN(9) + 7;
	vvl dp(2, vl(m, 0)); // dp[s.size()+1][m]
	REP(i, s.size()) {
		REP(j, m) dp[(i + 1) % 2][j] = 0;
		if (s[i] != '0') (dp[(i + 1)%2][(s[i] - '0') % m] += 1) %= mod;
		REP(j, m) {
			(dp[(i + 1)%2][(j * 10 + (s[i] - '0')) % m] += dp[i%2][j]) %= mod;
			(dp[(i + 1)%2][j] += dp[i%2][j]) %= mod;
		}
	}
	cout << dp[s.size()%2][0] + count(ALL(s), '0') << endl;
	return 0;
}