#include<bits/stdc++.h>
#define maxd 120
#define maxn 120000
using namespace std;
const int mod = 1000000007;
char s[maxn];
int K[maxn];
int f[maxn][maxd];
int main(){
	int D;
	cin >> s + 1 >> D;
	int n = strlen(s + 1);
	for(int i = 1; i <= n; i += 1) K[i] = s[i] - '0';
	int sum = 0;
	f[0][0] = 1;
	for(int i = 1; i <= n; i += 1){
		for(int j = 0; j < D; j += 1)
			for(int k = 0; k < 10; k += 1)
				f[i][j] = (f[i][j] + f[i - 1][(j + 10 * D - k) % D]) % mod;
		for(int k = K[i] + 1; k < 10; k += 1)
			f[i][(sum + k) % D] = (f[i][(sum + k) % D] + mod - 1) % mod;
		sum = (sum + K[i]) % D;
		
	}
	cout << (f[n][0] + mod - 1) % mod;
}
### 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>
#define maxd 120
#define maxn 120000
using namespace std;
const int mod = 1000000007;
char s[maxn];
int K[maxn];
int f[maxn][maxd];
int main(){
	int D;
	cin >> s + 1 >> D;
	int n = strlen(s + 1);
	for(int i = 1; i <= n; i += 1) K[i] = s[i] - '0';
	int sum = 0;
	f[0][0] = 1;
	for(int i = 1; i <= n; i += 1){
		for(int j = 0; j < D; j += 1)
			for(int k = 0; k < 10; k += 1)
				f[i][j] = (f[i][j] + f[i - 1][(j + 10 * D - k) % D]) % mod;
		for(int k = K[i] + 1; k < 10; k += 1)
			f[i][(sum + k) % D] = (f[i][(sum + k) % D] + mod - 1) % mod;
		sum = (sum + K[i]) % D;
		
	}
	cout << (f[n][0] + mod - 1) % mod;
}
```