#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	string T;
	cin>>T;
	int D;
	cin>>D;
	if(D==0){
		rep(i,T.size()){
			if(T[i]!='?'&&T[i]!='0'){
				cout<<"0\n";
				return ;
			}
		}
		cout<<"1\n";
		return ;
	}
	vector<ll> p(9);
	p[0]=1;
	int tmp=0;
	rep(i,T.size()){
		if(T[i]=='?'){
			vector<ll> n_p(9);
			rep(i,9) rep(j,10){
				n_p[(i+j)%9]=(n_p[(i+j)%9]+p[i])%mod;
			}
			swap(n_p,p);
		}else{
			tmp+=(int)(T[i]-'0');
		}
	}
	if(D==9&&tmp==0) p[0]--;
	cout<<p[((D-tmp)%9+9)%9]<<"\n";
}