#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
int main()
{
    string s;
    int m;
    cin>>s>>m;
    int n=s.size();
    ll dp[2][20002]={};
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            dp[(i&1)^1][j]=dp[i&1][j];
        }
        int x=s[i]-'0';
        if(x!=0) (dp[(i&1)^1][x%m]+=1)%=MOD;
        for(int j=0; j<m; j++){
            (dp[(i&1)^1][(10*j+x)%m]+=dp[i&1][j])%=MOD;
        }
    }
    ll ans=dp[n&1][0];
    for(int i=0; i<n; i++) if(s[i]=='0') (ans+=1)%=MOD;
    cout<<ans<<endl;
    return 0;
}