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

static const int MOD=1e9+7;

int main(){
    string K; cin >> K;
    int D; cin >> D;

    int N=K.size();
    long long dp[N+1][2][D+1]; //dp[桁数][上限ギリギリかどうか][Dで割ったあまり]
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    for(int i=0;i<N;i++){
        int s=K[i]-'0';
        for(int k=0;k<D;k++){
            for(int j=0;j<2;j++){
                for(int d=0;d<=(j?9:s);d++){
                    dp[i+1][j||(d<s)][(k+d)%D]+=dp[i][j][k%D]%MOD;
                    dp[i+1][j||(d<s)][(k+d)%D]%=MOD;
                }
            }
        }
    }
    long long ans=((dp[N][0][0]+dp[N][1][0])%MOD+MOD-1)%MOD;
    cout << ans << endl;
}
### Prompt

Construct a CPP code solution to the problem outlined:

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;

static const int MOD=1e9+7;

int main(){
    string K; cin >> K;
    int D; cin >> D;

    int N=K.size();
    long long dp[N+1][2][D+1]; //dp[桁数][上限ギリギリかどうか][Dで割ったあまり]
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    for(int i=0;i<N;i++){
        int s=K[i]-'0';
        for(int k=0;k<D;k++){
            for(int j=0;j<2;j++){
                for(int d=0;d<=(j?9:s);d++){
                    dp[i+1][j||(d<s)][(k+d)%D]+=dp[i][j][k%D]%MOD;
                    dp[i+1][j||(d<s)][(k+d)%D]%=MOD;
                }
            }
        }
    }
    long long ans=((dp[N][0][0]+dp[N][1][0])%MOD+MOD-1)%MOD;
    cout << ans << endl;
}
```