#include <bits/stdc++.h>
using namespace std;
#define md 1000000007
string s;
int dp[10009][100][2],p,d;
inline int dfs(int n,int z,bool f){
	if(n==s.size()) return !z;
	int &res(dp[n][z][f]);
	if(~res) return res;
	res=0;
	int x=s[n]-'0';
	int r=(f?x:9);
	for(int i=0;i<=r;++i){
    	res+=dfs(n+1,(z+i)%d,f and i==r);
    	if(res>=md) res-=md;
	}
	return res;
}
int main(){
	memset(dp,-1,sizeof(dp));
	cin>>s>>d;
	cout<<(dfs(0,0,1)-1+md)%md<<endl;
}
### Prompt

Please formulate 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;
#define md 1000000007
string s;
int dp[10009][100][2],p,d;
inline int dfs(int n,int z,bool f){
	if(n==s.size()) return !z;
	int &res(dp[n][z][f]);
	if(~res) return res;
	res=0;
	int x=s[n]-'0';
	int r=(f?x:9);
	for(int i=0;i<=r;++i){
    	res+=dfs(n+1,(z+i)%d,f and i==r);
    	if(res>=md) res-=md;
	}
	return res;
}
int main(){
	memset(dp,-1,sizeof(dp));
	cin>>s>>d;
	cout<<(dfs(0,0,1)-1+md)%md<<endl;
}
```