#include <bits/stdc++.h>
using namespace std;
char a[10001];
long long f[10001][3][101];
int main()
{
	int ans=0,d,i,j,k,l,len;
	scanf("%s",a);
	scanf("%d",&d);
	len=strlen(a);
	f[0][0][0]=1;
	for(i=0;i<len;i++)
	{
        for(j=0;j<2;j++)
		{
            for(k=0;k<d;k++)
			{
                for(l=0;l<=(j?9:a[i]-'0');l++)
				{
					if(j==1||l<a[i]-'0')
					{
						f[i+1][1][(k+l)%d]+=f[i][j][k];
						f[i+1][1][(k+l)%d]%=1000000007;
					}
					else
					{
						f[i+1][0][(k+l)%d]+=f[i][j][k];
						f[i+1][0][(k+l)%d]%=1000000007;
					}
                }
            }
        }
    }
	printf("%lld",((f[len][0][0]+f[len][1][0]-1)%1000000007+1000000007)%1000000007);
	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>
using namespace std;
char a[10001];
long long f[10001][3][101];
int main()
{
	int ans=0,d,i,j,k,l,len;
	scanf("%s",a);
	scanf("%d",&d);
	len=strlen(a);
	f[0][0][0]=1;
	for(i=0;i<len;i++)
	{
        for(j=0;j<2;j++)
		{
            for(k=0;k<d;k++)
			{
                for(l=0;l<=(j?9:a[i]-'0');l++)
				{
					if(j==1||l<a[i]-'0')
					{
						f[i+1][1][(k+l)%d]+=f[i][j][k];
						f[i+1][1][(k+l)%d]%=1000000007;
					}
					else
					{
						f[i+1][0][(k+l)%d]+=f[i][j][k];
						f[i+1][0][(k+l)%d]%=1000000007;
					}
                }
            }
        }
    }
	printf("%lld",((f[len][0][0]+f[len][1][0]-1)%1000000007+1000000007)%1000000007);
	return 0;
}
```