#include <bits/stdc++.h>

using namespace std;
//#define int long long
const int mod = 1e9+7;

int dp[10003][100][2];

int main(){
	string K;
	int D; 
	cin >> K >> D;
	int n = K.length();
	
	for(int i = 0; i < K[0] - '0'; i++){
		dp[0][i%D][0]++;
	}
	dp[0][(K[0]-'0')%D ][1]++;
	
	for(int i = 1; i < n; i++){
		for(int j = 0; j < D; j++){
			for(int k = 0; k < 2; k++){
				int up = 9;
				if(k) up = K[i] - '0';
				for(int d = 0; d <= up; d++){
					int ns = k & (d==up);
					dp[i][(j+d)%D][ns]+=dp[i-1][j][k];
					dp[i][(j+d)%D][ns]%=mod;
				}
			}
		}
	}
	int res = 1ll*(dp[n-1][0][0] + dp[n-1][0][1]-1+mod) % mod;
	cout << res << "\n";
	return 0;
}

### Prompt

Your task is to create 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;
//#define int long long
const int mod = 1e9+7;

int dp[10003][100][2];

int main(){
	string K;
	int D; 
	cin >> K >> D;
	int n = K.length();
	
	for(int i = 0; i < K[0] - '0'; i++){
		dp[0][i%D][0]++;
	}
	dp[0][(K[0]-'0')%D ][1]++;
	
	for(int i = 1; i < n; i++){
		for(int j = 0; j < D; j++){
			for(int k = 0; k < 2; k++){
				int up = 9;
				if(k) up = K[i] - '0';
				for(int d = 0; d <= up; d++){
					int ns = k & (d==up);
					dp[i][(j+d)%D][ns]+=dp[i-1][j][k];
					dp[i][(j+d)%D][ns]%=mod;
				}
			}
		}
	}
	int res = 1ll*(dp[n-1][0][0] + dp[n-1][0][1]-1+mod) % mod;
	cout << res << "\n";
	return 0;
}

```