#include using namespace std; #define SZ(x) (int)(x.size()) #define REP(i, n) for(int i=0;i<(n);++i) #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RREP(i, n) for(int i=(int)(n);i>=0;--i) #define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i) #define ALL(a) (a).begin(),(a).end() #define DUMP(x) cerr<<#x<<" = "<<(x)<; using vvi = vector; using vll = vector; using vvll = vector; using P = pair; const double eps = 1e-8; const ll MOD = 1000000007; const int INF = INT_MAX / 2; const ll LINF = LLONG_MAX / 2; template bool chmax(T1 &a, const T2 &b) { if(a < b) {a = b; return true;} return false; } template bool chmin(T1 &a, const T2 &b) { if(a > b) {a = b; return true;} return false; } template ostream& operator<<(ostream &os, const pair p) { os << p.first << ":" << p.second; return os; } template ostream &operator<<(ostream &os, const vector &v) { REP(i, SZ(v)) { if(i) os << " "; os << v[i]; } return os; } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(10); string t; cin >> t; int n = SZ(t); int d; cin >> d; if(d == 0) { bool ok = true; REP(i, n) { ok &= t[i] == '?' || t[i] == '0'; } cout << ok << endl; return 0; } if(t == "?" && d == 9) { cout << 1 << endl; return 0; } ll now = 1; vvll dp(n+1, vll(9, 0)); dp[0][0] = 1; REP(i, n) { REP(j, 9) { if(t[i] == '?') { REP(k, 10) { (dp[i+1][(j+k)%9] += dp[i][j]) %= MOD; } } else { (dp[i+1][(j+(t[i]-'0'))%9] += dp[i][j]) %= MOD; } } } cout << dp[n][d%9] << endl; }