#include <iostream>
#include <string>
using namespace std;
int D;
int inf = 1e9+7;
int dp[10010][2][101] = {{{0}}};//何文字目か，小さいか，modD
string K;

int main(){
	cin >> K;
	cin >> 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 m = j ? 9 : K[i] - '0'; //j==1ならなんでもOK
				for(int l=0;l<m+1;l++){
					(dp[i+1][j || l<m][(k+l)%D] += dp[i][j][k])%=inf;
				}
			}
		}
	}
	int ans = 0;
	for(int i=0;i<2;i++){
		(ans += dp[n][i][0])%=inf;
	}
	cout << (ans-1+inf)%inf << endl;
}

### Prompt

Please formulate 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 <iostream>
#include <string>
using namespace std;
int D;
int inf = 1e9+7;
int dp[10010][2][101] = {{{0}}};//何文字目か，小さいか，modD
string K;

int main(){
	cin >> K;
	cin >> 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 m = j ? 9 : K[i] - '0'; //j==1ならなんでもOK
				for(int l=0;l<m+1;l++){
					(dp[i+1][j || l<m][(k+l)%D] += dp[i][j][k])%=inf;
				}
			}
		}
	}
	int ans = 0;
	for(int i=0;i<2;i++){
		(ans += dp[n][i][0])%=inf;
	}
	cout << (ans-1+inf)%inf << endl;
}

```