#include <bits/stdc++.h>

using namespace std;

#define x first
#define y second
#define mp make_pair
#define pb push_back

typedef long long ll;

const ll MOD = 1e9+7;
const ll INF = 1e9+5;

int n, D;
string s;
int memo[10005][105][2];

int dp(int i, int o, bool m) {
	if (i==n) {
		if (o) return 0;
		return 1;
	}
	if (memo[i][o][m] != -1) return memo[i][o][m];
	int mxd = m?9:s[i]-'0';
	int uk = 0;
	for (int d=0 ; d<=mxd ; d++) {
		uk = (uk + dp(i+1, (o+d)%D, m|(d<s[i]-'0'))) % MOD;
	}
	return memo[i][o][m] = uk;
}

int main() {
	memset(memo, -1, sizeof memo);
	cin >>s;
	scanf("%d", &D);
	n = s.size();
	printf("%d\n", (MOD+dp(0, 0, 0)-1)%MOD);
	return 0;
}
### 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>

using namespace std;

#define x first
#define y second
#define mp make_pair
#define pb push_back

typedef long long ll;

const ll MOD = 1e9+7;
const ll INF = 1e9+5;

int n, D;
string s;
int memo[10005][105][2];

int dp(int i, int o, bool m) {
	if (i==n) {
		if (o) return 0;
		return 1;
	}
	if (memo[i][o][m] != -1) return memo[i][o][m];
	int mxd = m?9:s[i]-'0';
	int uk = 0;
	for (int d=0 ; d<=mxd ; d++) {
		uk = (uk + dp(i+1, (o+d)%D, m|(d<s[i]-'0'))) % MOD;
	}
	return memo[i][o][m] = uk;
}

int main() {
	memset(memo, -1, sizeof memo);
	cin >>s;
	scanf("%d", &D);
	n = s.size();
	printf("%d\n", (MOD+dp(0, 0, 0)-1)%MOD);
	return 0;
}
```