#include <bits/stdc++.h>
#include <assert.h>

using namespace std;

long long dp[10001][2][100];

const int mod = 1e9 + 7;

int main()
{
	string k;
	int d;
	cin >> k >> d;
	int size = k.size();
	dp[0][0][0] = 1;
	for (int i = 0; i < size; i++)
		for (int j = 0; j < 2; j++)
			for (int l = 0; l < d; l++)
				for (int n = 0; n <= (j == 0 ? k[i] - '0' : 9); n++)
					dp[i + 1][j || (n < k[i] - '0')][(l + n) % d] = (dp[i + 1][j || (n < k[i] - '0')][(l + n) % d] + dp[i][j][l]) % mod;
	cout << (-1<dp[size][0][0] + dp[size][1][0] - 1?dp[size][0][0] + dp[size][1][0] - 1:mod-1) % mod << endl;

	return 0;
}

### Prompt

In Cpp, your task is to solve 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>
#include <assert.h>

using namespace std;

long long dp[10001][2][100];

const int mod = 1e9 + 7;

int main()
{
	string k;
	int d;
	cin >> k >> d;
	int size = k.size();
	dp[0][0][0] = 1;
	for (int i = 0; i < size; i++)
		for (int j = 0; j < 2; j++)
			for (int l = 0; l < d; l++)
				for (int n = 0; n <= (j == 0 ? k[i] - '0' : 9); n++)
					dp[i + 1][j || (n < k[i] - '0')][(l + n) % d] = (dp[i + 1][j || (n < k[i] - '0')][(l + n) % d] + dp[i][j][l]) % mod;
	cout << (-1<dp[size][0][0] + dp[size][1][0] - 1?dp[size][0][0] + dp[size][1][0] - 1:mod-1) % mod << endl;

	return 0;
}

```