#include <bits/stdc++.h>

using namespace std;
const int mod = 1e9 + 7;
int main(){
	string k; int D; cin >> k >> D;
	int n = k.size();
	vector<vector<int>> dp(D, vector<int>(2));
	dp[0][0] = 1;
	for(int i = 0; i < n; ++i){
		vector<vector<int>> new_dp(D, vector<int>(2));
		int t = k[i] - '0';
		for(int j = 0; j < D; ++j){
			for(int d = 0; d <= 9; ++d){
				new_dp[(j+d)%D][1] += dp[j][1] + (d<t?dp[j][0]:0);
				new_dp[(j+d)%D][1] %= mod;
			}
			new_dp[(j+t)%D][0] += dp[j][0];
			new_dp[(j+t)%D][0] %= mod;
		}
		dp = new_dp;
	}
	int ans = (dp[0][0] + dp[0][1]) % mod; ans = (ans-1+mod)%mod;
	cout << ans;
}
### Prompt

Please create a solution in cpp 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;
const int mod = 1e9 + 7;
int main(){
	string k; int D; cin >> k >> D;
	int n = k.size();
	vector<vector<int>> dp(D, vector<int>(2));
	dp[0][0] = 1;
	for(int i = 0; i < n; ++i){
		vector<vector<int>> new_dp(D, vector<int>(2));
		int t = k[i] - '0';
		for(int j = 0; j < D; ++j){
			for(int d = 0; d <= 9; ++d){
				new_dp[(j+d)%D][1] += dp[j][1] + (d<t?dp[j][0]:0);
				new_dp[(j+d)%D][1] %= mod;
			}
			new_dp[(j+t)%D][0] += dp[j][0];
			new_dp[(j+t)%D][0] %= mod;
		}
		dp = new_dp;
	}
	int ans = (dp[0][0] + dp[0][1]) % mod; ans = (ans-1+mod)%mod;
	cout << ans;
}
```