#include<cstdio>
#include<cstring>
const int L=10003,M=1e9+7;
inline int Mod(int a){return a<M?a:a-M;}
int d[L],l,m,f[L][103],s;char t[L];
signed main(){
	scanf("%s%d",t,&m);
	l=strlen(t);
	for(int i=1;i<=l;i++)d[i]=t[i-1]-48;
	for(int i=1;i<=l;i++){
	  for(int k=0;k<10;k++){
		for(int j=0;j<m;j++)
		  f[i][(j+k)%m]=Mod(f[i][(j+k)%m]+f[i-1][j]);
		if(k<d[i])f[i][(s+k)%m]=Mod(f[i][(s+k)%m]+1);
	  }
	  s=(s+d[i])%m;
	}
	printf("%d",(f[l][0]+(!s)-1+M)%M);
	return 0;
}
### Prompt

Please create a solution in Cpp 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 L=10003,M=1e9+7;
inline int Mod(int a){return a<M?a:a-M;}
int d[L],l,m,f[L][103],s;char t[L];
signed main(){
	scanf("%s%d",t,&m);
	l=strlen(t);
	for(int i=1;i<=l;i++)d[i]=t[i-1]-48;
	for(int i=1;i<=l;i++){
	  for(int k=0;k<10;k++){
		for(int j=0;j<m;j++)
		  f[i][(j+k)%m]=Mod(f[i][(j+k)%m]+f[i-1][j]);
		if(k<d[i])f[i][(s+k)%m]=Mod(f[i][(s+k)%m]+1);
	  }
	  s=(s+d[i])%m;
	}
	printf("%d",(f[l][0]+(!s)-1+M)%M);
	return 0;
}
```