#include "bits/stdc++.h"
#define MOD 1000000007
using namespace std;
int f[10002][100][2]={0};
char k[10001];
int main()
{
    int D,n;
    int i,j,l;
    scanf("%s",k);
    scanf("%d",&D);
    n=strlen(k);
    f[0][0][1]=1;
    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][j][0];
		f[i+1][(j+l)%D][0]%=MOD;
 	    }
	    for(l=0;l<=k[i]-'0';l++)
	    {
		if(l==k[i]-'0')
		{
		    f[i+1][(j+l)%D][1]+=f[i][j][1];
		    f[i+1][(j+l)%D][1]%=MOD;
		}
		else
		{
		    f[i+1][(j+l)%D][0]+=f[i][j][1];
		    f[i+1][(j+l)%D][0]%=MOD;
		}
	    }
	}
    }
    printf("%d\n",(MOD+f[n][0][0]+f[n][0][1]-1)%MOD);
    return 0;
}
### 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"
#define MOD 1000000007
using namespace std;
int f[10002][100][2]={0};
char k[10001];
int main()
{
    int D,n;
    int i,j,l;
    scanf("%s",k);
    scanf("%d",&D);
    n=strlen(k);
    f[0][0][1]=1;
    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][j][0];
		f[i+1][(j+l)%D][0]%=MOD;
 	    }
	    for(l=0;l<=k[i]-'0';l++)
	    {
		if(l==k[i]-'0')
		{
		    f[i+1][(j+l)%D][1]+=f[i][j][1];
		    f[i+1][(j+l)%D][1]%=MOD;
		}
		else
		{
		    f[i+1][(j+l)%D][0]+=f[i][j][1];
		    f[i+1][(j+l)%D][0]%=MOD;
		}
	    }
	}
    }
    printf("%d\n",(MOD+f[n][0][0]+f[n][0][1]-1)%MOD);
    return 0;
}
```