#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#pragma warning(disable:4996) 

typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

char str[100005];
ll dp[100005][9];

void solve()
{
    int D;
    scanf("%s%d", str, &D);
    int n = strlen(str);
    int i;
    if (D == 0) {
        for (i = 0; i < n; i++) {
            if (str[i] == '?' || str[i] == '0') {
                ;
            }
            else {
                printf("0\n"); return;
            }
        }
        printf("1\n"); return;
    }

    D = D % 9;
    dp[0][0] = 1;
    int j;
    for (i = 0; i < n; i++) {
        for (j = 0; j < 9; j++) {
            if (str[i] == '?') {
                int k;
                for (k = 0; k < 10; k++) {
                    int tmp = k%9;
                    int j2 = (j + tmp) % 9;
                    dp[i + 1][j2] = (dp[i + 1][j2] + dp[i][j]) % MOD;
                }                
            }
            else {
                int tmp = (str[i] - '0')%9;
                int j2 = (j + tmp) % 9;
                dp[i + 1][j2] = (dp[i + 1][j2] + dp[i][j]) % MOD;
            }
        }
    }
    int dd = 0;
    if (D == 0) {
        int flag = 0;
        for (i = 0; i < n; i++) {
            if (str[i] == '?' || str[i] == '0') {
                ;
            }
            else {
                flag = 1;
            }
        }
        if (flag == 0) dd = 1;
    }
    printf("%lld\n", dp[n][D]-dd);


    return;
}


int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        //printf("Case #%d: ", t+1);
        solve();
    }
#endif
    return 0;
}