#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MD=1e9+7;
string s;
int l,d;
ll dp[12345][2][102];
ll fun(int i,int st,int su)
{
	if(dp[i][st][su]!=-1) return dp[i][st][su];
	if(i==l)
	{
		if(su==0) return 1;
		else return 0;
	}
	ll ans=0;
	for(int j=0;j<10;j++)
	{
		if(!st)
		{
			if(j<s[i]-'0')
			ans=(ans+fun(i+1,1,(su+j)%d))%MD;
			else if(j==s[i]-'0')
			ans=(ans+fun(i+1,0,(su+j)%d))%MD;
		}
		else
		ans=(ans+fun(i+1,1,(su+j)%d))%MD;
	}
	return dp[i][st][su]=ans;
}
int main()
{
	cin>>s>>d;
	l=s.length();
	memset(dp,-1,sizeof(dp));
	cout<<(fun(0,0,0)-1+MD)%MD;
	return 0;
}
### Prompt

Create a solution in cpp for 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;
typedef long long ll;
const int MD=1e9+7;
string s;
int l,d;
ll dp[12345][2][102];
ll fun(int i,int st,int su)
{
	if(dp[i][st][su]!=-1) return dp[i][st][su];
	if(i==l)
	{
		if(su==0) return 1;
		else return 0;
	}
	ll ans=0;
	for(int j=0;j<10;j++)
	{
		if(!st)
		{
			if(j<s[i]-'0')
			ans=(ans+fun(i+1,1,(su+j)%d))%MD;
			else if(j==s[i]-'0')
			ans=(ans+fun(i+1,0,(su+j)%d))%MD;
		}
		else
		ans=(ans+fun(i+1,1,(su+j)%d))%MD;
	}
	return dp[i][st][su]=ans;
}
int main()
{
	cin>>s>>d;
	l=s.length();
	memset(dp,-1,sizeof(dp));
	cout<<(fun(0,0,0)-1+MD)%MD;
	return 0;
}
```