#include <bits/stdc++.h>
#define mk make_pair
using namespace std;
typedef long long ll;
const int N = 3e5;
const int mod = 1e9 + 7;
char s[N];
int n, d;
ll dp[N][101][2];
int main() {
	scanf("%s", s + 1);
	cin >> d;
	n = strlen(s + 1);
	dp[0][0][1] = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < d; ++j) {
			for (int k = 0; k < 10; ++k) {
				(dp[i][(j + k) % d][0] += dp[i - 1][j][0]) %= mod;
				if (s[i] - '0' == k)
					(dp[i][(j + k) % d][1] += dp[i - 1][j][1]) %= mod;
				if (s[i] - '0' > k)
					(dp[i][(j + k) % d][0] += dp[i - 1][j][1]) %= mod;
			}
		}
	}
	cout << (dp[n][0][0] + dp[n][0][1] + mod - 1) % 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>
#define mk make_pair
using namespace std;
typedef long long ll;
const int N = 3e5;
const int mod = 1e9 + 7;
char s[N];
int n, d;
ll dp[N][101][2];
int main() {
	scanf("%s", s + 1);
	cin >> d;
	n = strlen(s + 1);
	dp[0][0][1] = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < d; ++j) {
			for (int k = 0; k < 10; ++k) {
				(dp[i][(j + k) % d][0] += dp[i - 1][j][0]) %= mod;
				if (s[i] - '0' == k)
					(dp[i][(j + k) % d][1] += dp[i - 1][j][1]) %= mod;
				if (s[i] - '0' > k)
					(dp[i][(j + k) % d][0] += dp[i - 1][j][1]) %= mod;
			}
		}
	}
	cout << (dp[n][0][0] + dp[n][0][1] + mod - 1) % mod;
}


```