#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)

using namespace std;
using LL = long long;
using P = pair<int,int>;
const LL mod=1e9+7;

LL dp[10010][110][2];

int main(){
	string K;
	cin >> K;
	int N=K.size();
	LL D;
	cin >> D;
	dp[0][0][0]=1;
	rep(i,N){
		int n=K[i]-'0';
		rep(j,D){
			(dp[i+1][(j+n)%D][0]+=dp[i][j][0])%=mod;
			rep(k,10) (dp[i+1][(j+k)%D][1]+=dp[i][j][1])%=mod;
			rep(k,n) (dp[i+1][(j+k)%D][1]+=dp[i][j][0])%=mod;
		}
	}
	LL ans=dp[N][0][0]+dp[N][0][1]-1;
	if(ans<0) ans+=mod;
	cout << ans << 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>
#define rep(i,n) for(int i=0; i<(int)(n); i++)

using namespace std;
using LL = long long;
using P = pair<int,int>;
const LL mod=1e9+7;

LL dp[10010][110][2];

int main(){
	string K;
	cin >> K;
	int N=K.size();
	LL D;
	cin >> D;
	dp[0][0][0]=1;
	rep(i,N){
		int n=K[i]-'0';
		rep(j,D){
			(dp[i+1][(j+n)%D][0]+=dp[i][j][0])%=mod;
			rep(k,10) (dp[i+1][(j+k)%D][1]+=dp[i][j][1])%=mod;
			rep(k,n) (dp[i+1][(j+k)%D][1]+=dp[i][j][0])%=mod;
		}
	}
	LL ans=dp[N][0][0]+dp[N][0][1]-1;
	if(ans<0) ans+=mod;
	cout << ans << endl;

	return 0;
}
```