#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=1e4+5;
ll dp[N][150][2],sum,ans;
int n;string s;
int main()
{
	cin>>s>>n;
	sum=s[0]-'0';
	dp[0][sum%n][1]=1;
	for(int i=0;i<s[0]-'0';i++)dp[0][i%n][0]+=1;
	for(int i=1;i<s.size();i++)//位数 
	{
		sum+=s[i]-'0';
		for(int j=0;j<n;j++)//上一次 
		{
			for(int k=0;k<10;k++)//canadd
			{
				dp[i][(j+k)%n][0]+=dp[i-1][j][0];
				dp[i][(j+k)%n][0]%=mod;
				if(k<s[i]-'0')
				{
					dp[i][(j+k)%n][0]+=dp[i-1][j][1];
					dp[i][(j+k)%n][0]%=mod;
				}
			}
		}
		dp[i][sum%n][1]=1;
	}
	cout<<(dp[s.size()-1][0][0]+dp[s.size()-1][0][1]-1+mod)%mod<<endl;
	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>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=1e4+5;
ll dp[N][150][2],sum,ans;
int n;string s;
int main()
{
	cin>>s>>n;
	sum=s[0]-'0';
	dp[0][sum%n][1]=1;
	for(int i=0;i<s[0]-'0';i++)dp[0][i%n][0]+=1;
	for(int i=1;i<s.size();i++)//位数 
	{
		sum+=s[i]-'0';
		for(int j=0;j<n;j++)//上一次 
		{
			for(int k=0;k<10;k++)//canadd
			{
				dp[i][(j+k)%n][0]+=dp[i-1][j][0];
				dp[i][(j+k)%n][0]%=mod;
				if(k<s[i]-'0')
				{
					dp[i][(j+k)%n][0]+=dp[i-1][j][1];
					dp[i][(j+k)%n][0]%=mod;
				}
			}
		}
		dp[i][sum%n][1]=1;
	}
	cout<<(dp[s.size()-1][0][0]+dp[s.size()-1][0][1]-1+mod)%mod<<endl;
	return 0;
}
```