#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int mod = 1000000007;

int dp[2][3][20005];

int main(void) {
  string s; int m; cin >> s >> m;
  int n = s.size();
  dp[0][0][0] = 1;
  for(int i=0; i<n; ++i) {
    memset(dp[(i+1)&1], 0, sizeof(dp[(i+1)&1]));
    for(int md=0; md<m; ++md) {
      for(int state=0; state<3; ++state) {
        if(dp[i&1][state][md] == 0) { continue; }
        int d   = s[i] - '0',
            nmd = (md * 10 + d) % m;
        dp[(i+1)&1][state][md] += dp[i&1][state][md];
        dp[(i+1)&1][state][md] %= mod;
        if((state == 0 && d) || state == 2) {
          dp[(i+1)&1][2][nmd] += dp[i&1][state][md];
          dp[(i+1)&1][2][nmd] %= mod;
        } else if(state == 0 && !d) {
          dp[(i+1)&1][1][nmd] += dp[i&1][state][md];
          dp[(i+1)&1][1][nmd] %= mod;
        }
      }
    }
  }
  int res = (dp[n&1][1][0] + dp[n&1][2][0]) % mod;
  printf("%d\n", res);
  return 0;
}