#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string k;
ll d,mod=1e9+7,dp[10005][105][2][2];
ll gao(int x,int y,int z,int t){
    if(x==k.size())return (y==0 and z==1);
    ll &ans=dp[x][y][z][t],b=t?k[x]-'0':9;
    if(ans!=-1)return ans;
    ans=0;
    for(int i=0;i<=b;i++)
        ans+=gao(x+1,(y+i)%d,z or i!=0,(t and i==b)?1:0)%mod;
    return ans%=mod;
}
int main(){
	cin >> k >> d;
	memset(dp,-1,sizeof(dp));
	cout << gao(0,0,0,1);
    return 0;
}
### 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;
string k;
ll d,mod=1e9+7,dp[10005][105][2][2];
ll gao(int x,int y,int z,int t){
    if(x==k.size())return (y==0 and z==1);
    ll &ans=dp[x][y][z][t],b=t?k[x]-'0':9;
    if(ans!=-1)return ans;
    ans=0;
    for(int i=0;i<=b;i++)
        ans+=gao(x+1,(y+i)%d,z or i!=0,(t and i==b)?1:0)%mod;
    return ans%=mod;
}
int main(){
	cin >> k >> d;
	memset(dp,-1,sizeof(dp));
	cout << gao(0,0,0,1);
    return 0;
}
```