#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

string K;
int d;
const int mod=1000000007;
ll dp[10001][2][101];
int main(){
    cin>>K>>d;
    int n=K.size();
    dp[0][0][0]=1;
    rep(i,n)rep(j,2)rep(k,d){
        int ulim=j?9:K[i]-'0';
        rep(l,ulim+1){
            dp[i+1][j||l<ulim][(k+l)%d]+=dp[i][j][k];
            dp[i+1][j||l<ulim][(k+l)%d]%=mod;
        }
    }
    ll ans=0;
    rep(i,2) ans+=dp[n][i][0];
    cout<<(ans-1+mod)%mod<<endl;
    return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

Find the number of integers between 1 and K (inclusive) satisfying the following condition, modulo 10^9 + 7:

* The sum of the digits in base ten is a multiple of D.

Constraints

* All values in input are integers.
* 1 \leq K < 10^{10000}
* 1 \leq D \leq 100

Input

Input is given from Standard Input in the following format:


K
D


Output

Print the number of integers satisfying the condition, modulo 10^9 + 7.

Examples

Input

30
4


Output

6


Input

1000000009
1


Output

2


Input

98765432109876543210
58


Output

635270834

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

string K;
int d;
const int mod=1000000007;
ll dp[10001][2][101];
int main(){
    cin>>K>>d;
    int n=K.size();
    dp[0][0][0]=1;
    rep(i,n)rep(j,2)rep(k,d){
        int ulim=j?9:K[i]-'0';
        rep(l,ulim+1){
            dp[i+1][j||l<ulim][(k+l)%d]+=dp[i][j][k];
            dp[i+1][j||l<ulim][(k+l)%d]%=mod;
        }
    }
    ll ans=0;
    rep(i,2) ans+=dp[n][i][0];
    cout<<(ans-1+mod)%mod<<endl;
    return 0;
}

```