#include<iostream>
using namespace std;
int d,m=1e9+7,dp[10001][2][100];
string s;
int main()
{
	cin>>s>>d;
	dp[0][0][0]=1;
	for(int i=0;i<s.size();i++)
	{
		for(int j=0;j<2;j++)
		{
			int L=j?9:s[i]-48;
			for(int l=0;l<=L;l++)
			{
				for(int k=0;k<d;k++)
					(dp[i+1][j|l<L][(k+l)%d]+=dp[i][j][k])%=m;
			}
		}
	}
	cout<<(dp[s.size()][0][0]+dp[s.size()][1][0]-1L+m)%m<<endl;
}
### Prompt

Generate a cpp solution 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>
using namespace std;
int d,m=1e9+7,dp[10001][2][100];
string s;
int main()
{
	cin>>s>>d;
	dp[0][0][0]=1;
	for(int i=0;i<s.size();i++)
	{
		for(int j=0;j<2;j++)
		{
			int L=j?9:s[i]-48;
			for(int l=0;l<=L;l++)
			{
				for(int k=0;k<d;k++)
					(dp[i+1][j|l<L][(k+l)%d]+=dp[i][j][k])%=m;
			}
		}
	}
	cout<<(dp[s.size()][0][0]+dp[s.size()][1][0]-1L+m)%m<<endl;
}
```