#include <iostream>
#include <cstring>

using namespace std;

typedef long long ll;

string k;
int d, n;
ll dp[100005][105][2];
const ll mod = (ll)1e9 + 7;

ll rek(int x, int sad, bool p){
	if(x == n)
		return (sad == 0);
	ll &ret = dp[x][sad][p];
	if(ret != -1)
		return ret;
	ret = 0;
	int gr = (p ? k[x] - '0' : 9);
	for(int i = 0 ; i <= gr ; ++i){
		ret = (ret + rek(x + 1, (sad + i) % d, (i == gr ? p : 0))) % mod;
	}
	return ret;
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> k;
cin >> d;
n = (int)k.size();
memset(dp, -1, sizeof(dp));
ll t = (rek(0, 0, 1) - 1 + mod) % mod; 
cout << t << endl;

return 0;
}


### 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 <cstring>

using namespace std;

typedef long long ll;

string k;
int d, n;
ll dp[100005][105][2];
const ll mod = (ll)1e9 + 7;

ll rek(int x, int sad, bool p){
	if(x == n)
		return (sad == 0);
	ll &ret = dp[x][sad][p];
	if(ret != -1)
		return ret;
	ret = 0;
	int gr = (p ? k[x] - '0' : 9);
	for(int i = 0 ; i <= gr ; ++i){
		ret = (ret + rek(x + 1, (sad + i) % d, (i == gr ? p : 0))) % mod;
	}
	return ret;
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> k;
cin >> d;
n = (int)k.size();
memset(dp, -1, sizeof(dp));
ll t = (rek(0, 0, 1) - 1 + mod) % mod; 
cout << t << endl;

return 0;
}


```