#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <numeric>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define SZ(x) ((int)x.size())
#define fi first
#define se second
const int INF = 1e15;
using namespace std;

template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class T>
inline bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>
inline bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

const int mod = 1e9+7;
int dp[100010][10];

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);

    string T; cin >> T;
    int D; cin >> D;
    int pos;
    dp[0][0]=1;
    rep(i,SZ(T)) {
        if(T[i]=='?') {
            rep(j,10) {
                rep(k,10) {
                    if(j+k>=10){
                        pos=(j+k)%10+1;
                    } else {
                        pos=j+k;
                    }
                    dp[i+1][pos] += dp[i][j];
                    dp[i+1][pos] %= mod;
                }
            }
        } else {
            rep(j,10) {
                pos = j+(T[i]-'0');
                if(pos>=10) pos=pos%10+1;
                dp[i+1][pos] += dp[i][j];
                dp[i+1][pos] %= mod;
            }
        }
    }
    cout << dp[SZ(T)][D] << endl;
}