#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;

ll dp[20000][2][100];
int main(){
	string s;int d;cin>>s>>d;
	dp[0][0][0]=1;
	rep(i,s.size())rep(j,2)rep(k,d){
		int lim=(j==0?s[i]-'0':9);
		for(int t=0;t<=lim;t++){
			(dp[i+1][j||t<lim][(k+t)%d]+=dp[i][j][k])%=MOD;
		}
	}
	cout<<(dp[s.size()][0][0]+dp[s.size()][1][0]+MOD-1)%MOD<<endl;
}
### Prompt

Please create a solution in CPP 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>
#define rep(i,n)for(int i=0;i<(n);i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;

ll dp[20000][2][100];
int main(){
	string s;int d;cin>>s>>d;
	dp[0][0][0]=1;
	rep(i,s.size())rep(j,2)rep(k,d){
		int lim=(j==0?s[i]-'0':9);
		for(int t=0;t<=lim;t++){
			(dp[i+1][j||t<lim][(k+t)%d]+=dp[i][j][k])%=MOD;
		}
	}
	cout<<(dp[s.size()][0][0]+dp[s.size()][1][0]+MOD-1)%MOD<<endl;
}
```