#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	std::string s;
	std::cin >> s;
	int n = s.size();
	int d = ri();
	bool zero_possible = !std::count_if(s.begin(), s.end(), [] (char c) { return c != '?' && c != '0'; });
	if (d == 0) {
		puts(zero_possible ? "1" : "0");
		return 0;
	}
	if (d == 9) d = 0;
	int dp[n + 1][9];
	memset(dp, 0, sizeof(dp));
	dp[0][0] = 1;
	auto add = [&] (int &i, int j) {
		i += j;
		if (i >= 1000000007) i -= 1000000007;
	};
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 9; j++) {
			if (s[i] == '?') {
				for (int k = 0; k < 10; k++) add(dp[i + 1][(j + k) % 9], dp[i][j]);
			} else add(dp[i + 1][(j + s[i] - '0') % 9], dp[i][j]);
		}
	}
	dp[n][d] -= (!d && zero_possible);
	if (dp[n][d] < 0) dp[n][d] += 1000000007;
	printf("%d\n", dp[n][d]);
	return 0;
}