#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <string>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef __int64_t ll;

int m;

/* Returns the next state from st. */
int next_state(int st, char ch) {
  if (st == 2) { // fail
    return 2;
  }
  if (st == 1) { // "0"
    return 2; // This automaton never accepts string of form /0..*/
  }
  if (st == 0) { // init, ""
    if (ch == '0') {
      return 1; // "0"
    }
    return (ch - '0') % m + 3;
  }
  int q = st - 3;
  return (q * 10 + (ch - '0')) % m + 3;
}
const int M = 101000;
ll dp[2][M] = {};
const ll mod = 1e9 + 7;

int main(void){
  string s;
  cin >> s >> m;
  int len = s.length();
  dp[0][0] = 1;
  int t = 0;
  /* invariant condition : t == (i - 1) % 2*/
  REP (i, 1, len + 1) {
    t = 1 - t; // alternating, t == i % 2
    REP (j, 0, m + 3) {
      dp[t][j] = 0;
    }
    REP (j, 0, m + 3) {
      ll &d1 = dp[t][j];
      d1 += dp[1 - t][j];
      d1 %= mod;
      ll &d2 = dp[t][next_state(j, s[i - 1])];
      d2 += dp[1 - t][j];
      d2 %= mod;
    }
  }
  // accepting states are {1, 3}
  cout << (dp[len % 2][1] + dp[len % 2][3]) % mod << endl;
}