#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e4+3;
int dp[maxn][102][2];
char s[maxn], d;
int main()
{
	scanf("%s %d", s+1, &d);
	int len = strlen(s+1);
	dp[0][0][1] = 1;
	for (int i = 0; i < len; ++i)
		for (int j = 0; j < d; ++j)
			for (int k = 0; k < 10; ++k)
			{
				int to = (j+k)%d;
				if (dp[i][j][1])
				{
					if (k<s[i+1]-'0')
						dp[i+1][to][0] = (dp[i+1][to][0] + dp[i][j][1])%mod;
					else if (k==s[i+1]-'0')
						dp[i+1][to][1] = (dp[i+1][to][1] + dp[i][j][1])%mod;
				}
				if (dp[i][j][0])
					dp[i+1][to][0] = (dp[i+1][to][0] + dp[i][j][0])%mod;
			}
	printf("%d\n", (dp[len][0][1] + dp[len][0][0]-1+mod)%mod);
	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 <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e4+3;
int dp[maxn][102][2];
char s[maxn], d;
int main()
{
	scanf("%s %d", s+1, &d);
	int len = strlen(s+1);
	dp[0][0][1] = 1;
	for (int i = 0; i < len; ++i)
		for (int j = 0; j < d; ++j)
			for (int k = 0; k < 10; ++k)
			{
				int to = (j+k)%d;
				if (dp[i][j][1])
				{
					if (k<s[i+1]-'0')
						dp[i+1][to][0] = (dp[i+1][to][0] + dp[i][j][1])%mod;
					else if (k==s[i+1]-'0')
						dp[i+1][to][1] = (dp[i+1][to][1] + dp[i][j][1])%mod;
				}
				if (dp[i][j][0])
					dp[i+1][to][0] = (dp[i+1][to][0] + dp[i][j][0])%mod;
			}
	printf("%d\n", (dp[len][0][1] + dp[len][0][0]-1+mod)%mod);
	return 0;
}
```