#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

ll dp[100001][10];

string T;
int D;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> T >> D;
    dp[0][0] = 1;
    int N = T.size();
    if(D == 0){
        for(int i = 0; i < N; i++){
            if(T[i] != '0' && T[i] != '?'){
                cout << 0 << endl;
                return 0;
            }
        }
        cout << 1 << endl;
        return 0;
    }
    for(int i = 0; i < N; i++){
        for(int j = 0; j < 9; j++){
            if(T[i] == '?'){
                for(int k = 0; k < 10; k++){
                    dp[i+1][(j+k)%9] += dp[i][j];
                    dp[i+1][(j+k)%9] %= MOD;
                }
            }else{
                int k = T[i]-'0';
                dp[i+1][(j+k)%9] += dp[i][j];
                dp[i+1][(j+k)%9] %= MOD;
            }
        }
    }
    if(D == 9){
        for(int i = 0; i < N; i++){
            if(T[i] != '0' && T[i] != '?'){
                cout << dp[N][0] << endl;
                return 0;
            }
        }
        cout << (dp[N][0]+MOD-1)%MOD << endl;
        return 0;
    }
    cout << dp[N][D%9] << endl;
}