#include <bits/stdc++.h>

const int mod = 1e9 + 7;
char S[10001];
int M;
int64_t dp0[20000], dp1[20000];
const int N = 16;

int main() {
    scanf("%s %d", S, &M);
    int n = strlen(S), d = 10 % M;
    int zero = 0;
    for (int i = 0; i < n; i++) S[i] -= '0', zero += S[i] == 0;
    const int U = n / N, V = n % N;
    for (int ii = 0; ii < U; ii++) {
        for (int j = 0; j < N; j++) {
            int i = ii * N + j;
            memcpy(dp1, dp0, sizeof(dp1));
            int k = S[i] % M;
            if (S[i] != 0) dp0[S[i] % M]++;
            for (int j = 0; j < M; j++) { dp0[k] += dp1[j]; k += d; if (k >= M) k -= M; }
        }
        for (int i = 0; i < M; i++) dp0[i] %= mod;
    }
    for (int ii = 0; ii < V; ii++) {
        int i = U * N + ii;
        memcpy(dp1, dp0, sizeof(dp1));
        int k = S[i] % M;
        if (S[i] != 0) dp0[S[i] % M]++;
        for (int j = 0; j < M; j++) { dp0[k] += dp1[j]; k += d; if (k >= M) k -= M; }
    }
    printf("%lld\n", (dp0[0] + zero) % mod);
}