#include<bits/stdc++.h>
int d, dp[10005][2][105];
std::string s;

int dp_solve(int idx, bool lim, int mod) {
	if(idx == (int) s.size()) return (int) mod == 0;
	int &ans = dp[idx][lim][mod];
	if(~ans) return ans;
	ans = 0;
	for(int i = 0; i <= (lim ? 9 : s[idx] - '0'); i++) ans = (ans + dp_solve(idx+1, lim || i < s[idx] - '0', (mod + i) % d)) % 1000000007;
	return ans;
}

int main() {
	std::cin >> s >> d;
	memset(dp, -1, sizeof dp);
	std::cout << (dp_solve(0, 0, 0) - 1 + 1000000007) % 1000000007 << '\n';
	return 0;
}

### Prompt

Generate 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>
int d, dp[10005][2][105];
std::string s;

int dp_solve(int idx, bool lim, int mod) {
	if(idx == (int) s.size()) return (int) mod == 0;
	int &ans = dp[idx][lim][mod];
	if(~ans) return ans;
	ans = 0;
	for(int i = 0; i <= (lim ? 9 : s[idx] - '0'); i++) ans = (ans + dp_solve(idx+1, lim || i < s[idx] - '0', (mod + i) % d)) % 1000000007;
	return ans;
}

int main() {
	std::cin >> s >> d;
	memset(dp, -1, sizeof dp);
	std::cout << (dp_solve(0, 0, 0) - 1 + 1000000007) % 1000000007 << '\n';
	return 0;
}

```