#include"bits/stdc++.h"
using namespace std;
int f[10001][101][2];
int d,n;
char a[10001];
int main()
{
	cin>>a;
	cin>>d;
	n=strlen(a);
	f[0][0][1]=1;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<d;j++)
		{
			for(int k=0;k<=9;k++)
				f[i+1][(j+k)%d][0]=((long long)f[i+1][(j+k)%d][0]+f[i][j][0])%1000000007;
			for(int k=0;k<=a[i]-'0';k++)
			{
				if(k==(a[i]-'0'))
					f[i+1][(j+k)%d][1]=((long long)f[i+1][(j+k)%d][1]+f[i][j][1])%1000000007;
				else
					f[i+1][(j+k)%d][0]=((long long)f[i+1][(j+k)%d][0]+f[i][j][1])%1000000007;
			}
		}
	}
	printf("%d",(int)((((long long)f[n][0][0]+f[n][0][1])-1+1000000007)%1000000007));
}
### Prompt

Create a solution in CPP for 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;
int f[10001][101][2];
int d,n;
char a[10001];
int main()
{
	cin>>a;
	cin>>d;
	n=strlen(a);
	f[0][0][1]=1;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<d;j++)
		{
			for(int k=0;k<=9;k++)
				f[i+1][(j+k)%d][0]=((long long)f[i+1][(j+k)%d][0]+f[i][j][0])%1000000007;
			for(int k=0;k<=a[i]-'0';k++)
			{
				if(k==(a[i]-'0'))
					f[i+1][(j+k)%d][1]=((long long)f[i+1][(j+k)%d][1]+f[i][j][1])%1000000007;
				else
					f[i+1][(j+k)%d][0]=((long long)f[i+1][(j+k)%d][0]+f[i][j][1])%1000000007;
			}
		}
	}
	printf("%d",(int)((((long long)f[n][0][0]+f[n][0][1])-1+1000000007)%1000000007));
}
```