#include "bits/stdc++.h"

using namespace std;

const int MOD = 1e9 + 7;

int dp[10010][2][128];

void solve()
{
	string K;
	int D;
	cin >> K >> D;

	int N = K.size();

	dp[0][1][0] = 1;

	for (int i = 0; i < N; i++)
	{
		int d = K[i] - '0';
		for (int f = 0; f < 2; f++)
			for (int m = 0; m < D; m++)
				for (int nd = 0; nd <= (f ? d : 9); nd++)
				{
					dp[i + 1][f & (nd == d)][(m + nd) % D] += dp[i][f][m];
					dp[i + 1][f & (nd == d)][(m + nd) % D] %= MOD;
				}
	}

	cout << (dp[N][0][0] + dp[N][1][0] + MOD - 1) % MOD << endl;

}

int main()
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}

### Prompt

Please create a solution in CPP 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;

const int MOD = 1e9 + 7;

int dp[10010][2][128];

void solve()
{
	string K;
	int D;
	cin >> K >> D;

	int N = K.size();

	dp[0][1][0] = 1;

	for (int i = 0; i < N; i++)
	{
		int d = K[i] - '0';
		for (int f = 0; f < 2; f++)
			for (int m = 0; m < D; m++)
				for (int nd = 0; nd <= (f ? d : 9); nd++)
				{
					dp[i + 1][f & (nd == d)][(m + nd) % D] += dp[i][f][m];
					dp[i + 1][f & (nd == d)][(m + nd) % D] %= MOD;
				}
	}

	cout << (dp[N][0][0] + dp[N][1][0] + MOD - 1) % MOD << endl;

}

int main()
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}

```