#include <bits/stdc++.h>
using namespace std;
long long dp[2][20001];
int M = 1000000007;
int main(){
    string s;
    cin >> s;
    int n = s.length(), m;
    cin >> m;
    int zero = -1;
    dp[0][0] = 1;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            dp[(i + 1) & 1][j] = (dp[(i + 1) & 1][j] + dp[i & 1][j]) % M;
            dp[(i + 1) & 1][(j * 10 + s[i] - '0') % m] = (dp[(i + 1) & 1][(j * 10 + s[i] - '0') % m] + dp[i & 1][j]) % M;
        }
        if (s[i] == '0')
        {
            dp[(i + 1) & 1][0] = (dp[(i + 1) & 1][0] + M - 1) % M;
            ++zero;
        }
        for (int j = 0; j < m; j++)
        {
            dp[i & 1][j] = 0;
        }
    }
    cout << (dp[n & 1][0] + zero) % M << "\n";
    return 0;
}