// ClassyNumbers
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
ll dp[ 10005 ][ 105 ][ 2 ];
string s;
ll d;
 
ll Solve(ll pos, ll sum, bool tight){
	if(pos == s.length())
		return sum == 0;
	if(dp[pos][sum][tight] != -1)
		return dp[pos][sum][tight];
 
	ll ans = 0;
	
	ll end = ((tight)?(s[pos]-'0'):9);
	for(ll i = 0; i<=end ;i++){
		ans =  (ans +Solve(pos+1,(sum+i)%d,tight&(i == end)))%mod;
	}
	return dp[pos][sum][tight] = ans;
}
 
 
int main(){
	
	cin>>s;
	cin>>d;
	memset(dp,-1,sizeof(dp));
 
	cout<<(Solve(0,0,1)-1+mod)%mod<<endl;
 
	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
// ClassyNumbers
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
ll dp[ 10005 ][ 105 ][ 2 ];
string s;
ll d;
 
ll Solve(ll pos, ll sum, bool tight){
	if(pos == s.length())
		return sum == 0;
	if(dp[pos][sum][tight] != -1)
		return dp[pos][sum][tight];
 
	ll ans = 0;
	
	ll end = ((tight)?(s[pos]-'0'):9);
	for(ll i = 0; i<=end ;i++){
		ans =  (ans +Solve(pos+1,(sum+i)%d,tight&(i == end)))%mod;
	}
	return dp[pos][sum][tight] = ans;
}
 
 
int main(){
	
	cin>>s;
	cin>>d;
	memset(dp,-1,sizeof(dp));
 
	cout<<(Solve(0,0,1)-1+mod)%mod<<endl;
 
	return 0;
}
```