#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

char s[12525];
int a[12525];
int n;
int m;

// pos,modM
ll dp[10010][20010];

int main(){
  scanf("%s",s);
  n = strlen(s);
  scanf("%d",&m);
  REP(i,n)a[i]=s[i]-'0';
  dp[0][0] = 0;
  int cnt0 = 0;
  REP(pos,n){
    int c = a[pos];
    if(c==0)cnt0++;
    if(c!=0)dp[pos+1][c%m] += 1;
    REP(md,m){
      dp[pos+1][md] += dp[pos][md];
      if(dp[pos+1][md]>=MOD)dp[pos+1][md]-=MOD;
      int nmd = (md*10+c)%m;
      dp[pos+1][nmd] += dp[pos][md];
      if(dp[pos+1][nmd]>=MOD)dp[pos+1][nmd]-=MOD;
    }
  }
  int ans = dp[n][0]+cnt0;
  if(ans>=MOD)ans-=MOD;
  printf("%d\n",ans);
  return 0;
}