#include<cstdio>
#include<cstring>
const int MAXN=10010;
const int MOD=1e9+7;

int n,k;
int f[MAXN][110],ans;
char ch[MAXN];

void upd(int &x,int y){
	x=(x+(y+MOD)%MOD)%MOD;
}
int main() {
	scanf("%s%d",ch+1,&k);n=strlen(ch+1);
	f[1][0]=1;
	for(int i=2;i<=n;i++)
		for(int d=0;d<=9;d++)
			for(int j=0;j<=k;j++)
				upd(f[i][(d+j)%k],f[i-1][j]);
	int sum=0;
	for(int i=1;i<=n;i++){
		for(int j=0;j<ch[i]-'0';j++)
			upd(ans,f[n-i+1][(-(sum+j)%k+k)%k]);
		sum=(sum+ch[i]-'0')%k;
	}
	if(sum)
		upd(ans,-1);
	printf("%d\n",ans);
	return 0;
}
### Prompt

Your task is to create 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<cstdio>
#include<cstring>
const int MAXN=10010;
const int MOD=1e9+7;

int n,k;
int f[MAXN][110],ans;
char ch[MAXN];

void upd(int &x,int y){
	x=(x+(y+MOD)%MOD)%MOD;
}
int main() {
	scanf("%s%d",ch+1,&k);n=strlen(ch+1);
	f[1][0]=1;
	for(int i=2;i<=n;i++)
		for(int d=0;d<=9;d++)
			for(int j=0;j<=k;j++)
				upd(f[i][(d+j)%k],f[i-1][j]);
	int sum=0;
	for(int i=1;i<=n;i++){
		for(int j=0;j<ch[i]-'0';j++)
			upd(ans,f[n-i+1][(-(sum+j)%k+k)%k]);
		sum=(sum+ch[i]-'0')%k;
	}
	if(sum)
		upd(ans,-1);
	printf("%d\n",ans);
	return 0;
}
```