#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1000000007;
constexpr int M = 100010;
long long dp[M][9];

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string T; cin >> T;
    int D; cin >> D;
    bool zero = true;
    for (auto &c: T) {
        if (c != '0' && c != '?') {
            zero = false;
        }
    }
    if (D == 0) {
        cout << zero << "\n";
        return 0;
    }
    dp[0][0] = 1;
    int N = T.size();
    for (int i = 0; i < N; i++) {
        if (T[i] != '?') {
            for (int j = 0; j < 9; j++) {
                dp[i+1][(j+T[i]-'0')%9] = dp[i][j]; 
            }
        } else {
            for (int j = 0; j < 9; j++) {
                dp[i][j] %= mod;
                for (int k = 0; k < 10; k++) {
                    dp[i+1][(j+k)%9] += dp[i][j];
                }
            }
        }
    }
    if (zero) dp[N][0]--;
    cout << dp[N][D%9] % mod << "\n";
    return 0;
}