#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int MOD = 1e9+7;
string S;
int M;

int DP[2][20000];

void solve() {
    cin>>S>>M;
    REP(i,2)REP(j,M) DP[i][j]=0;
    REP(i,S.size()) {
        int c = S[i]-'0';
        if (i>0) {
            REP(j,M) {
                int d = (j * 10 + c) % M;
                DP[i%2][d] += DP[(i-1)%2][j];
                DP[i%2][d] %= MOD;
            }
        }
        if (c!=0) DP[i%2][c%M] += 1;
        REP(j,M) DP[(i+1)%2][j] = DP[i%2][j];
    }
    REP(i,S.size()) {
        if (S[i]=='0') {
            DP[(S.size()-1)%2][0] += 1;
        }
    }
    cout << DP[(S.size()-1)%2][0] << endl;
}