#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;

int main(){
    string s;
    int d;
    cin>>s>>d;
    int n=s.size();
    ll dp[n+1][2][d];
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    for(int i=0;i<n;i++){
        int num=s[i]-'0';
        for(int j=0;j<2;j++){
            for(int k=0;k<d;k++){
                for(int l=0;l<=(j?9:num);l++){
                    dp[i+1][j||l<num][(k+l)%d]+=dp[i][j][k];
                    dp[i+1][j||l<num][(k+l)%d]%=MOD;
                }
            }
        }
    }
    cout<<(dp[n][0][0]+dp[n][1][0]+MOD-1)%MOD<<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;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;

int main(){
    string s;
    int d;
    cin>>s>>d;
    int n=s.size();
    ll dp[n+1][2][d];
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    for(int i=0;i<n;i++){
        int num=s[i]-'0';
        for(int j=0;j<2;j++){
            for(int k=0;k<d;k++){
                for(int l=0;l<=(j?9:num);l++){
                    dp[i+1][j||l<num][(k+l)%d]+=dp[i][j][k];
                    dp[i+1][j||l<num][(k+l)%d]%=MOD;
                }
            }
        }
    }
    cout<<(dp[n][0][0]+dp[n][1][0]+MOD-1)%MOD<<endl;
}
```