#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;

string S;
int M;

int main()
{
  
  cin >> S;
  for(int i = 0; i < S.size(); i++) S[i] -= '0';
  cin >> M;
  int ret = 0;
  int dp[2][20000];
  int *now = dp[0], *nxt = dp[1];
  
  for(int i = 0; i < S.size(); i++) {
    memset(nxt, 0, sizeof(int) * 20000);
    ret += S[i] == 0;
    (nxt[S[i] % M] += S[i] != 0) %= mod;
    for(int j = M - 1; j >= 0; j--) {
      (nxt[j] += now[j]) %= mod;
      (nxt[(j * 10 + S[i]) % M] += now[j]) %= mod;
    }
    swap(now, nxt);
  }
  cout << (now[0] + ret) % mod << endl;
}