#include <iostream>
#include <string>

using namespace std;

#define MOD 1000000007

long long dp[10002][100][2] = {};

int main() {
	string K; cin >> K;
	int D; cin >> D;
	int sz = K.size();
	dp[0][0][0] = 1;
	for (int i = 0; i < sz; ++i) {
		int c = K[i] - '0';
		for (int j = 0; j < D; ++j)
			for (int smaller = 0; smaller < 2; ++smaller)
				for (int k = 0; k < 10; ++k)
					if (k < c) (dp[i + 1][(j + k) % D][1] += dp[i][j][smaller]) %= MOD;
					else if (k == c) (dp[i + 1][(j + k) % D][smaller] += dp[i][j][smaller]) %= MOD;
					else if (smaller) (dp[i + 1][(j + k) % D][1] += dp[i][j][1]) %= MOD;
	}
	cout << (dp[sz][0][0] + dp[sz][0][1] - 1 + MOD) % MOD << endl;

	return 0;
}

### Prompt

In CPP, your task is to solve 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 <iostream>
#include <string>

using namespace std;

#define MOD 1000000007

long long dp[10002][100][2] = {};

int main() {
	string K; cin >> K;
	int D; cin >> D;
	int sz = K.size();
	dp[0][0][0] = 1;
	for (int i = 0; i < sz; ++i) {
		int c = K[i] - '0';
		for (int j = 0; j < D; ++j)
			for (int smaller = 0; smaller < 2; ++smaller)
				for (int k = 0; k < 10; ++k)
					if (k < c) (dp[i + 1][(j + k) % D][1] += dp[i][j][smaller]) %= MOD;
					else if (k == c) (dp[i + 1][(j + k) % D][smaller] += dp[i][j][smaller]) %= MOD;
					else if (smaller) (dp[i + 1][(j + k) % D][1] += dp[i][j][1]) %= MOD;
	}
	cout << (dp[sz][0][0] + dp[sz][0][1] - 1 + MOD) % MOD << endl;

	return 0;
}

```