#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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;}

ll pow_mod(ll x, ll n){
    if(n==0) return 1;
    ll ret=pow_mod((x*x) % 9, n/2);
    if(n&1) ret=(ret*x)%9;
    return ret;
}


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    string s;cin>>s;
    int d;cin>>d;

    if(d==0){
        bool f=true;
        for(auto c:s){
            if(c!='0' and c!='?') f=false;
        }
        cout<<f<<endl;
        return 0;
    }

    d%=9;

    vector<ll> dp(10,0);
    dp[0]=1;

    reverse(ALL(s));

    rep(i,(int)s.size()){
        vector<ll> newdp(10,0);
        if(s[i]=='?'){
            rep(t,10){
                rep(j,10){
                    int to=(j+t*pow_mod(10,i))%9;
                    newdp[to]+=dp[j];
                    newdp[to]%=mod;      
                }
            }

        }else{
            int t=s[i]-'0';
            for(int j=0;j<10;j++){
                int to=(j+t*pow_mod(10,i))%9;
                newdp[to]+=dp[j];
                newdp[to]%=mod;
            }
        }
        swap(dp,newdp);
    }

    cout<<dp[d]<<endl;
    return 0;
}