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

Your challenge is to write 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<bits/stdc++.h>
using namespace std;
int f[10001][101][2];
char a[10001];
int main()
{
	f[0][0][1]=1;
	int i,j,l;
	int n,D;
	scanf("%s",a);
	scanf("%d",&D);
	n=strlen(a);
	for(i=0;i<n;i++)
    	{
		for(j=0;j<D;j++)
		{
			for(l=0;l<=9;l++)
				f[i+1][(j+l)%D][0]=(f[i+1][(j+l)%D][0]+f[i][j][0])%1000000007;
			for(l=0;l<=a[i]-'0';l++)
				if(l==a[i]-'0')
					f[i+1][(j+l)%D][1]=(f[i+1][(j+l)%D][1]+f[i][j][1])%1000000007;
				else
					f[i+1][(j+l)%D][0]=(f[i+1][(j+l)%D][0]+f[i][j][1])%1000000007;
		}
      	}
	printf("%d",(f[n][0][1]+f[n][0][0]+1000000006)%1000000007);
}
```