#include <bits/stdc++.h>

using namespace std;
#define ll long long

#define mod 1000000007

ll dp[10005][105][2], d;
string s;


ll solve(ll pos, ll modi, bool tight){
	//base case
	if(pos == s.length()){
		return modi==0;
	}
	//recursive case
	if(dp[pos][modi][tight]!=-1){return dp[pos][modi][tight];}

	ll ans=0;
	ll end= (tight)?(s[pos]-'0'):9;
	for(ll i=0; i<=end; i++){
		ll t = (solve(pos+1, (modi+i)%d, tight&(i==end)))%mod;
		ans += t;
		ans %= mod;
	}
	return dp[pos][modi][tight] = ans;
}

int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	memset(dp, -1, sizeof(dp));
	cin>>s;
	cin>>d;
	cout<<(solve(0, 0, 1)-1+mod)%mod;
}
### Prompt

Develop a solution in Cpp to the problem described below:

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 ll long long

#define mod 1000000007

ll dp[10005][105][2], d;
string s;


ll solve(ll pos, ll modi, bool tight){
	//base case
	if(pos == s.length()){
		return modi==0;
	}
	//recursive case
	if(dp[pos][modi][tight]!=-1){return dp[pos][modi][tight];}

	ll ans=0;
	ll end= (tight)?(s[pos]-'0'):9;
	for(ll i=0; i<=end; i++){
		ll t = (solve(pos+1, (modi+i)%d, tight&(i==end)))%mod;
		ans += t;
		ans %= mod;
	}
	return dp[pos][modi][tight] = ans;
}

int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	memset(dp, -1, sizeof(dp));
	cin>>s;
	cin>>d;
	cout<<(solve(0, 0, 1)-1+mod)%mod;
}
```