#include<iostream>
#include<string>

using namespace std;

const long long MOD=1000000007;

string s;
long long n,dp[2][110][10010]={0};

signed main(){
    cin>>s>>n;
    dp[0][0][0]=0;
    dp[1][0][0]=1;
    for(int i=0;i<s.length();++i){
        for(int j=0;j<n;++j){
            for(int k=0;k<=9;++k){
                (dp[0][(j+k)%n][i+1]+=dp[0][j][i])%=MOD;
            }
            for(int k=0;k<s[i]-'0';++k){
                (dp[0][(j+k)%n][i+1]+=dp[1][j][i])%=MOD;
            }
            (dp[1][(j+s[i]-'0')%n][i+1]+=dp[1][j][i])%=MOD;
        }
    }

    cout<<(dp[0][0][s.length()]-1+dp[1][0][s.length()]+MOD)%MOD<<endl;

    return 0;
}
### Prompt

Please create a solution in cpp to the following problem:

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<iostream>
#include<string>

using namespace std;

const long long MOD=1000000007;

string s;
long long n,dp[2][110][10010]={0};

signed main(){
    cin>>s>>n;
    dp[0][0][0]=0;
    dp[1][0][0]=1;
    for(int i=0;i<s.length();++i){
        for(int j=0;j<n;++j){
            for(int k=0;k<=9;++k){
                (dp[0][(j+k)%n][i+1]+=dp[0][j][i])%=MOD;
            }
            for(int k=0;k<s[i]-'0';++k){
                (dp[0][(j+k)%n][i+1]+=dp[1][j][i])%=MOD;
            }
            (dp[1][(j+s[i]-'0')%n][i+1]+=dp[1][j][i])%=MOD;
        }
    }

    cout<<(dp[0][0][s.length()]-1+dp[1][0][s.length()]+MOD)%MOD<<endl;

    return 0;
}
```