#include <cstdio>
const int mod = 1000000007;
char s[10010];
long long dp[110], t[110];
void add(long long &v, long long x) {
	v += x;
	if (v >= mod) v -= mod;
}
int main() {
	int d;
	scanf("%s%d", s, &d);
	int a = 0;
	for (int i = 0; s[i]; i++) {
		s[i] -= '0';
		for (int j = 0; j < d; j++) {
			t[j] = 0;
		}
		for (int k = 0; k < 10; k++) {
			for (int j = 0; j < d; j++) {
				add(t[(j+k)%d], dp[j]);
			}
		}
		for (int k = 0; k < s[i]; k++) {
			add(t[(a+k)%d], 1ll);
		}
		a = (a + s[i]) % d;
		for (int j = 0; j < d; j++) {
			dp[j] = t[j];
		}
	}
	dp[0] += (a == 0) - 1;
	dp[0] = (dp[0] + mod) % mod;
	printf("%lld\n", dp[0]);
	return 0;
}

### Prompt

Your task is to create 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 <cstdio>
const int mod = 1000000007;
char s[10010];
long long dp[110], t[110];
void add(long long &v, long long x) {
	v += x;
	if (v >= mod) v -= mod;
}
int main() {
	int d;
	scanf("%s%d", s, &d);
	int a = 0;
	for (int i = 0; s[i]; i++) {
		s[i] -= '0';
		for (int j = 0; j < d; j++) {
			t[j] = 0;
		}
		for (int k = 0; k < 10; k++) {
			for (int j = 0; j < d; j++) {
				add(t[(j+k)%d], dp[j]);
			}
		}
		for (int k = 0; k < s[i]; k++) {
			add(t[(a+k)%d], 1ll);
		}
		a = (a + s[i]) % d;
		for (int j = 0; j < d; j++) {
			dp[j] = t[j];
		}
	}
	dp[0] += (a == 0) - 1;
	dp[0] = (dp[0] + mod) % mod;
	printf("%lld\n", dp[0]);
	return 0;
}

```