#include<bits/stdc++.h>
using namespace std;
long long M=1e9+7;
int solve(){
	int d,n;
	string s;
	cin>>s>>d;
	n=s.size();//first solve for n-1 digits upperbound is 9;
	long long dp[n][d];
	memset(dp,0,sizeof(dp));
	dp[0][0]=1;
	for(int i=1;i<n;i++){
		for(int j=0;j<d;j++){
			for(int x=0;x<=9;x++){
				dp[i][(j+x)%d]=(dp[i][(j+x)%d]+dp[i-1][j])%M;
			}
		}
	}
	long long ans=M-1; //subtracting 1 for zero;
	int t=0;
	for(int i=0;i<n;i++){
		for(int x=0;x<(s[i]-'0');x++){
			ans=(ans+(dp[n-i-1][(d-(x+t)%d)%d]))%M;
		}
		t+=(s[i]-'0');
	}
	if(t%d==0) ans++;
	return ans;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout<<solve();
	
}
### 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<bits/stdc++.h>
using namespace std;
long long M=1e9+7;
int solve(){
	int d,n;
	string s;
	cin>>s>>d;
	n=s.size();//first solve for n-1 digits upperbound is 9;
	long long dp[n][d];
	memset(dp,0,sizeof(dp));
	dp[0][0]=1;
	for(int i=1;i<n;i++){
		for(int j=0;j<d;j++){
			for(int x=0;x<=9;x++){
				dp[i][(j+x)%d]=(dp[i][(j+x)%d]+dp[i-1][j])%M;
			}
		}
	}
	long long ans=M-1; //subtracting 1 for zero;
	int t=0;
	for(int i=0;i<n;i++){
		for(int x=0;x<(s[i]-'0');x++){
			ans=(ans+(dp[n-i-1][(d-(x+t)%d)%d]))%M;
		}
		t+=(s[i]-'0');
	}
	if(t%d==0) ans++;
	return ans;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout<<solve();
	
}
```