#include <bits/stdc++.h>
using namespace std;
int d[10005][3][105],n,m;
char s[10005];

int main()
{
    scanf("%s %d", &s, &n);
    m = strlen(s);
	d[0][0][0] = 1;
	for(int i = 0;i < m;i++)
	{
		for(int j = 0;j < 2;j++)
		{
			int x = j ? 9 : s[i]-48;
			for(int l = 0;l <= x;l++)
			{
				for(int k = 0;k < n;k++)
					(d[i+1][j | l < x][(k+l) % n] += d[i][j][k]) %= 1000000007;
			}
		}
	}
	cout << (d[m][0][0]+d[m][1][0]-1+1000000007) % 1000000007;
}
### Prompt

Please formulate 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;
int d[10005][3][105],n,m;
char s[10005];

int main()
{
    scanf("%s %d", &s, &n);
    m = strlen(s);
	d[0][0][0] = 1;
	for(int i = 0;i < m;i++)
	{
		for(int j = 0;j < 2;j++)
		{
			int x = j ? 9 : s[i]-48;
			for(int l = 0;l <= x;l++)
			{
				for(int k = 0;k < n;k++)
					(d[i+1][j | l < x][(k+l) % n] += d[i][j][k]) %= 1000000007;
			}
		}
	}
	cout << (d[m][0][0]+d[m][1][0]-1+1000000007) % 1000000007;
}
```