#include <iostream>
#define mod 1000000007
using namespace std;
int dp[10005][105][2];
int main(int argc, char** argv) {
	string a;
	cin >> a;
	int d,n=a.size();
	cin >> d;
	a=' '+a;
	for(int i=1;i<=n;i++)
		a[i]-='0';
	dp[0][0][1]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<d;j++)
		{
			for(int k=0;k<10;k++)
			{
				dp[i][(j+k)%d][0]+=dp[i-1][j][0];
				if(k<a[i]) dp[i][(j+k)%d][0]+=dp[i-1][j][1];
				if(k==a[i]) dp[i][(j+k)%d][1]+=dp[i-1][j][1];
				dp[i][(j+k)%d][0]%=mod;
			}
		}
	}
	cout << (dp[n][0][0]+dp[n][0][1]+mod-1)%mod;
	return 0;
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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>
#define mod 1000000007
using namespace std;
int dp[10005][105][2];
int main(int argc, char** argv) {
	string a;
	cin >> a;
	int d,n=a.size();
	cin >> d;
	a=' '+a;
	for(int i=1;i<=n;i++)
		a[i]-='0';
	dp[0][0][1]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<d;j++)
		{
			for(int k=0;k<10;k++)
			{
				dp[i][(j+k)%d][0]+=dp[i-1][j][0];
				if(k<a[i]) dp[i][(j+k)%d][0]+=dp[i-1][j][1];
				if(k==a[i]) dp[i][(j+k)%d][1]+=dp[i-1][j][1];
				dp[i][(j+k)%d][0]%=mod;
			}
		}
	}
	cout << (dp[n][0][0]+dp[n][0][1]+mod-1)%mod;
	return 0;
}
```