#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
const int md = 1e9+7;
int d, sz, ac;
long long dp[105];
string s;
int main(){
	cin >> s >> d;
	rep(i,s.size()){
		long long tmp[105] = {};
		rep(j,d) rep(k,10) (tmp[(j+k)%d] += dp[j]) %= md;
		rep(j,s[i]-'0') (tmp[(ac+j)%d] += 1) %= md;
		rep(j,d) dp[j] = tmp[j];
		ac += s[i]-'0';
	}
	printf("%lld\n", (dp[0] + (ac%d == 0) - 1 + md) % md);
}
### Prompt

Your challenge is to write 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 rep(i,n) for(int i = 0; i < n; i++)
const int md = 1e9+7;
int d, sz, ac;
long long dp[105];
string s;
int main(){
	cin >> s >> d;
	rep(i,s.size()){
		long long tmp[105] = {};
		rep(j,d) rep(k,10) (tmp[(j+k)%d] += dp[j]) %= md;
		rep(j,s[i]-'0') (tmp[(ac+j)%d] += 1) %= md;
		rep(j,d) dp[j] = tmp[j];
		ac += s[i]-'0';
	}
	printf("%lld\n", (dp[0] + (ac%d == 0) - 1 + md) % md);
}
```