#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MAX_N=11000;
const int MOD=1e9+7;
string S;
int D;

ll dp[MAX_N][111];

ll dfs(int pos, int m, bool limit)
{
	if(pos==(int)S.length()) return m==0;
	if(!limit && dp[pos][m]!=-1) return dp[pos][m];
	ll res = 0;
	int ub = limit ? S[pos]-'0' : 9;
	for(int i=0;i<=ub; ++i){
		res = (res + dfs(pos+1, (m+i)%D, (limit && i==ub)))%MOD;
	}
	res %= MOD;
	if(!limit) dp[pos][m]=res;
	return res;
}

void solve()
{
    memset(dp, -1, sizeof(dp));
	int ans = dfs(0, 0, true) % MOD;
	cout << (ans-1+MOD)%MOD << endl;
}

int main()
{
	cin >> S >> D;
	solve();
	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;
using ll=long long;
const int MAX_N=11000;
const int MOD=1e9+7;
string S;
int D;

ll dp[MAX_N][111];

ll dfs(int pos, int m, bool limit)
{
	if(pos==(int)S.length()) return m==0;
	if(!limit && dp[pos][m]!=-1) return dp[pos][m];
	ll res = 0;
	int ub = limit ? S[pos]-'0' : 9;
	for(int i=0;i<=ub; ++i){
		res = (res + dfs(pos+1, (m+i)%D, (limit && i==ub)))%MOD;
	}
	res %= MOD;
	if(!limit) dp[pos][m]=res;
	return res;
}

void solve()
{
    memset(dp, -1, sizeof(dp));
	int ans = dfs(0, 0, true) % MOD;
	cout << (ans-1+MOD)%MOD << endl;
}

int main()
{
	cin >> S >> D;
	solve();
	return 0;
}
```