#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 11
#else
#define SIZE 123450
#endif

int D;
string T;
// i番目までみたときの余りがj
int DP[SIZE][10];
int MOD=1e9+7;

void solve() {
    cin>>T>>D;
    int n = 0;
    int cntq = 0;
    int nz = 0;
    REP(i,T.size()) {
        if (T[i]=='?') {
            cntq++;
        } else {
            (n += T[i]-'0')%=9;
            if (T[i]!='0') nz++;
        }
    }
    if (D==0) {
        if (nz==0) {
            cout << 1 << endl;
        } else {
            cout << 0 << endl;
        }
        return;
    }
    if (nz && !n) n=9;
    if (!cntq) {
        if (n == D) {
            cout << 1 << endl;
        } else {
            cout << 0 << endl;
        }
        return;
    }
    int r = D-n;
    while (r<0) r+=9;
    if (r == 9) r = 0;
    REP(i,cntq)REP(j,10) {
        if (!i) {
            DP[i][j%9]+=1;
        } else {
            REP(k,9) {
                (DP[i][(k+j)%9] += DP[i-1][k])%=MOD;
            }
        }
    }
    int ans = DP[cntq-1][r];
    if (nz==0 && D==9) {
        ans--;
    }
    cout << ans << endl;
}