#include <bits/stdc++.h>
using namespace std;

#define INF (INT64_MAX)
#define MOD (1000000000+7)
#define MAX 10000

string K;
int D;

long long dp[MAX + 1][2][100];

int main() {
	cin >> K >> D;

	int n = K.size();
	dp[0][0][0] = 1;
	for( int i = 0; i < n; i++ ) {
		for( int j = 0; j < 2; j++ ) {
			for( int k = 0; k < D; k++ ) {
				int d = K[i] - '0';
				if( j ) {
					d = 9;
				}
				for( int l = 0; l <= d; l++ ) {
					dp[i + 1][j || l < d][(k + l) % D] += dp[i][j][k];
					dp[i + 1][j || l < d][(k + l) % D] %= MOD;
				}
			}
		}
	}
	long long ans = (dp[n][0][0] + dp[n][1][0] - 1 + MOD) % MOD;

	cout << ans << endl;

	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;

#define INF (INT64_MAX)
#define MOD (1000000000+7)
#define MAX 10000

string K;
int D;

long long dp[MAX + 1][2][100];

int main() {
	cin >> K >> D;

	int n = K.size();
	dp[0][0][0] = 1;
	for( int i = 0; i < n; i++ ) {
		for( int j = 0; j < 2; j++ ) {
			for( int k = 0; k < D; k++ ) {
				int d = K[i] - '0';
				if( j ) {
					d = 9;
				}
				for( int l = 0; l <= d; l++ ) {
					dp[i + 1][j || l < d][(k + l) % D] += dp[i][j][k];
					dp[i + 1][j || l < d][(k + l) % D] %= MOD;
				}
			}
		}
	}
	long long ans = (dp[n][0][0] + dp[n][1][0] - 1 + MOD) % MOD;

	cout << ans << endl;

	return 0;
}

```