#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int Mod = 1e9 + 7;
string s;
int d;

int dp[10005][105][2];

int solve(int idx, int mod, bool smaller)
{
	if(idx == s.size())
		return mod == 0;
	int &ans = dp[idx][mod][smaller];
	if(~ans)
		return ans;
	ans = 0;
	for(int v = 0; v <= 9; v++)
	{
		if(!smaller && v > s[idx] - '0')
			continue;
		ans = (ans + solve(idx + 1, (mod + v) % d, smaller | v < s[idx] - '0')) % Mod;
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> s >> d;
	memset(dp, -1, sizeof dp);
	cout << (solve(0, 0, 0) - 1 + Mod) % Mod;
	return 0;
}

### Prompt

Generate 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;

typedef long long ll;
typedef long double ld;

const int Mod = 1e9 + 7;
string s;
int d;

int dp[10005][105][2];

int solve(int idx, int mod, bool smaller)
{
	if(idx == s.size())
		return mod == 0;
	int &ans = dp[idx][mod][smaller];
	if(~ans)
		return ans;
	ans = 0;
	for(int v = 0; v <= 9; v++)
	{
		if(!smaller && v > s[idx] - '0')
			continue;
		ans = (ans + solve(idx + 1, (mod + v) % d, smaller | v < s[idx] - '0')) % Mod;
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> s >> d;
	memset(dp, -1, sizeof dp);
	cout << (solve(0, 0, 0) - 1 + Mod) % Mod;
	return 0;
}

```