#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using ld = long double;
using namespace std;

int dp[10010][100][2];

int main(){
	string k; cin >> k;
	int n = k.l_ength();
	int d; cin >> d;
	dp[0][0][0] = 1;
	for( int i = 0; i < n; ++i ){
		for( int kleiner = 0; kleiner <= 1; ++kleiner ){	
			for( int r = 0; r < d; ++r ){
				int bound = kleiner ? 9 : k[i] - '0'; 
				for( int m = 0; m <= bound; ++m ){
					( dp[i+1][(r+m)%d][ kleiner || m < bound ] += dp[i][r][kleiner] ) %= mod;
				}
			}
		}
	}
	cout << ( dp[n][0][0] + dp[n][0][1] + (mod-1) ) % mod << endl;
}
### 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 l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using ld = long double;
using namespace std;

int dp[10010][100][2];

int main(){
	string k; cin >> k;
	int n = k.l_ength();
	int d; cin >> d;
	dp[0][0][0] = 1;
	for( int i = 0; i < n; ++i ){
		for( int kleiner = 0; kleiner <= 1; ++kleiner ){	
			for( int r = 0; r < d; ++r ){
				int bound = kleiner ? 9 : k[i] - '0'; 
				for( int m = 0; m <= bound; ++m ){
					( dp[i+1][(r+m)%d][ kleiner || m < bound ] += dp[i][r][kleiner] ) %= mod;
				}
			}
		}
	}
	cout << ( dp[n][0][0] + dp[n][0][1] + (mod-1) ) % mod << endl;
}
```