#include <bits/stdc++.h>
#define ll long long
using namespace std;
string a;
int m;
int mod=1e9+7;
long long out = 0;
int dp[10005][105],pref[10005][105];
void dawaj( string e)
{
	pref[0][0]=1;
	for(int i=1;e.size()>=i;i++)
	{
		int cyfra=e[i-1]-'0';
		for(int r=0;m>r;r++)
		{
			for(int c=0;9>=c;c++)
			{
				dp[i][(r+c)%m]=(dp[i][(r+c)%m]+dp[i-1][r])%mod;
			}
			for(int c=0;cyfra>=c;c++)
			{
				if(c==cyfra)
					{
						pref[i][(r+c)%m]=(pref[i][(r+c)%m] + pref[i-1][r])%mod;
					}
				else
					{
						dp[i][(r+c)%m] = ( dp[i][(r+c)%m ] + pref[i-1][r] )% mod;
					}

			}
		}
	}
}
int main(){
	cin>>a>>m;
	dawaj(a);
	cout<<(dp[a.size()][0]+pref[a.size()][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>
#define ll long long
using namespace std;
string a;
int m;
int mod=1e9+7;
long long out = 0;
int dp[10005][105],pref[10005][105];
void dawaj( string e)
{
	pref[0][0]=1;
	for(int i=1;e.size()>=i;i++)
	{
		int cyfra=e[i-1]-'0';
		for(int r=0;m>r;r++)
		{
			for(int c=0;9>=c;c++)
			{
				dp[i][(r+c)%m]=(dp[i][(r+c)%m]+dp[i-1][r])%mod;
			}
			for(int c=0;cyfra>=c;c++)
			{
				if(c==cyfra)
					{
						pref[i][(r+c)%m]=(pref[i][(r+c)%m] + pref[i-1][r])%mod;
					}
				else
					{
						dp[i][(r+c)%m] = ( dp[i][(r+c)%m ] + pref[i-1][r] )% mod;
					}

			}
		}
	}
}
int main(){
	cin>>a>>m;
	dawaj(a);
	cout<<(dp[a.size()][0]+pref[a.size()][0]-1+mod)%mod;
	return 0;
}

```