#include <bits/stdc++.h>
#define INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;

ll dp[100010][2][100];
	
int main(){
	string n; cin >> n;
	int nsize = n.l_ength();
	int m; cin >> m;
	dp[0][0][0] = 1;
	for( int i = 0; i < nsize; ++i ){
		for( int less = 0; less <= 1; ++less ){
			for( int k = 0; k < m; ++k ){
				int bound = less ? 9 : n[i] - '0';
				for( int d = 0; d <= bound; ++d ){
					( dp[i+1][ less || ( d != bound ) ][ (k+d)%m ] += dp[i][less][k] ) %= MOD;
				}
			}
		}
	}
	cout << ( dp[nsize][0][0] + dp[nsize][1][0] + 1000000006 ) % MOD << endl;
	return 0;
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

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 INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;

ll dp[100010][2][100];
	
int main(){
	string n; cin >> n;
	int nsize = n.l_ength();
	int m; cin >> m;
	dp[0][0][0] = 1;
	for( int i = 0; i < nsize; ++i ){
		for( int less = 0; less <= 1; ++less ){
			for( int k = 0; k < m; ++k ){
				int bound = less ? 9 : n[i] - '0';
				for( int d = 0; d <= bound; ++d ){
					( dp[i+1][ less || ( d != bound ) ][ (k+d)%m ] += dp[i][less][k] ) %= MOD;
				}
			}
		}
	}
	cout << ( dp[nsize][0][0] + dp[nsize][1][0] + 1000000006 ) % MOD << endl;
	return 0;
}
```