#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

struct mint {
	long long x;
	mint(long long x = 0) :x((x% mod + mod) % mod) {}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};


int main()
{
    
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
	string t; cin >> t;
	ll D; cin >> D;
	int sz = t.size();
	vector<vector<vector<mint>>> dp(sz + 1, vector<vector<mint>>(10,vector<mint>(2)));
	dp[0][0][0] = 1;
	for (int i = 0; i < sz; i++) {
		if (t[i] == '?') {
			for (int j = 0; j < 10; j++) {
				for (int k = 0; k < 10; k++) {
					int nj = j * 10 + k;
					nj %= 9;
					if (k == 0) {
						dp[i + 1][nj][0] += dp[i][j][0];
					}
					else {
						dp[i + 1][nj][1] += dp[i][j][0];
					}
					dp[i + 1][nj][1] += dp[i][j][1];
				}
			}
		}
		else {
			int k = t[i] - '0';
			for (int j = 0; j < 10; j++) {
				int nj = j * 10 + k;
				nj %= 9;
				if (k == 0) {
					dp[i + 1][nj][0] += dp[i][j][0];
				}
				else {
					dp[i + 1][nj][1] += dp[i][j][0];
				}
				dp[i + 1][nj][1] += dp[i][j][1];
			}
		}
	}
	if (D == 0) {
		cout << dp[sz][0][0].x << "\n";
	}
	else {
		cout << dp[sz][D % 9][1].x << "\n";
	}
    return 0;
}