#include <iostream>
#include <string>
#define ll long long
using namespace std;

ll mod=1000000007, dp[10010][110][2];

int main() {
	string K;
	int D;
	cin >> K >> D;
	dp[0][0][0]=1;
	for(int i=0; i<K.size(); ++i){
	    for(int j=0; j<D; ++j){
	        for(int r=0; r<10; ++r){
	            dp[i+1][(j+r)%D][1]=(dp[i+1][(j+r)%D][1]+dp[i][j][1])%mod;
	            if(r<K[i]-'0') dp[i+1][(j+r)%D][1]=(dp[i+1][(j+r)%D][1]+dp[i][j][0])%mod;
	            if(r==K[i]-'0') dp[i+1][(j+r)%D][0]=(dp[i+1][(j+r)%D][0]+dp[i][j][0])%mod;
	        }
	    }
	}
	cout << (dp[K.size()][0][0]+dp[K.size()][0][1]+mod-1)%mod << 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 <iostream>
#include <string>
#define ll long long
using namespace std;

ll mod=1000000007, dp[10010][110][2];

int main() {
	string K;
	int D;
	cin >> K >> D;
	dp[0][0][0]=1;
	for(int i=0; i<K.size(); ++i){
	    for(int j=0; j<D; ++j){
	        for(int r=0; r<10; ++r){
	            dp[i+1][(j+r)%D][1]=(dp[i+1][(j+r)%D][1]+dp[i][j][1])%mod;
	            if(r<K[i]-'0') dp[i+1][(j+r)%D][1]=(dp[i+1][(j+r)%D][1]+dp[i][j][0])%mod;
	            if(r==K[i]-'0') dp[i+1][(j+r)%D][0]=(dp[i+1][(j+r)%D][0]+dp[i][j][0])%mod;
	        }
	    }
	}
	cout << (dp[K.size()][0][0]+dp[K.size()][0][1]+mod-1)%mod << endl;
	return 0;
}

```