#include <iostream>
#include <vector>
#include <string>
using namespace std;

typedef long long ll;
const ll mod = 1e9 + 7;

int main() {
	string s;
	int m;
	cin >> s >> m;

	vector<int> nums(s.length());
	for (int i = 0; i < s.length(); i++) {
		nums[i] = s[i] - '0';
	}

	vector<ll> curr(m, 0);
	vector<ll> next(m, 0);
	ll zero_count = 0;
	for (int i = 0; i < nums.size(); i++) {
		for (int k = 0; k < m; k++) {
			int state = (k * 10 + nums[i]) % m;
			next[state] += curr[k];
			next[state] %= mod;
		}

		if (nums[i] == 0) {
			zero_count++;
		}
		else {
			next[nums[i] % m]++;
			next[nums[i] % m] %= mod;
		}

		curr = next;
	}

	cout << (curr[0] + zero_count) % mod << endl;
	
	return 0;
}