#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;
const int MOD7 = ( int ) 1e9 + 7;

string S;
int M;

void init(){
  cin >> S;
  cin >> M;
}

const int MAXM = ( int ) 2e5;

int dp[ 2 ][ MAXM ]; // rolling, mod M

void preprocess(){

}

void solve(){
  int ans = 0;
  dp[ 0 ][ 0 ] = 0;
  for( int i = 0; i < S.size(); ++i ){
    memset( dp[ ~i & 1 ], 0, sizeof( dp[ ~i & 1 ] ) );
    if( S[ i ] != '0' ){
      ( dp[ ~i & 1 ][ ( S[ i ] - '0' ) % M ] += 1 ) %= MOD7;
      if( ( S[ i ] - '0' ) % M == 0 )
        ( ans += 1 ) %= MOD7;
    } else{
      ( ans += 1 ) %= MOD7;
    }
    for( int j = 0; j < M; ++j ){
      ( dp[ ~i & 1 ][ ( j * 10 + S[ i ] - '0' ) % M ] += dp[ i & 1 ][ j ] ) %= MOD7;
      if( ( j * 10 + S[ i ] - '0' ) % M == 0 ){
        ( ans += dp[ i & 1 ][ j ] ) %= MOD7;
      }
      ( dp[ ~i & 1 ][ j ] += dp[ i & 1 ][ j ] ) %= MOD7;
    }
    // for( int j = 0; j < M; ++j ) cout << dp[ ~i & 1 ][ j ] << endl;
  }
  cout << ans << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}