#include <iostream>
using namespace std;
using ll = long long;
constexpr int MOD = 1e9 + 7;
 
int N;
int a[100010];
ll dp[10010][2][110];
 
int main(){
    string K;
    int D;
    cin >> K >> D;
    int N = K.size();
    dp[0][1][0] = 1;
    for(int i=0;i<N;++i){
        for(int tight=0; tight<2; ++tight){
            int x = (tight ? K[i]-'0' : 9);
            for(int j=0; j<=x; ++j){
                for(int d=0; d<=D; ++d){
                    dp[i+1][tight && x==j][(d+j)%D] += dp[i][tight][d]%MOD;
                }
            }
        }
    }
    cout << (dp[N][0][0] + dp[N][1][0] - 1)%MOD << endl;
    return 0;
}
### Prompt

Your task is to create 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>
using namespace std;
using ll = long long;
constexpr int MOD = 1e9 + 7;
 
int N;
int a[100010];
ll dp[10010][2][110];
 
int main(){
    string K;
    int D;
    cin >> K >> D;
    int N = K.size();
    dp[0][1][0] = 1;
    for(int i=0;i<N;++i){
        for(int tight=0; tight<2; ++tight){
            int x = (tight ? K[i]-'0' : 9);
            for(int j=0; j<=x; ++j){
                for(int d=0; d<=D; ++d){
                    dp[i+1][tight && x==j][(d+j)%D] += dp[i][tight][d]%MOD;
                }
            }
        }
    }
    cout << (dp[N][0][0] + dp[N][1][0] - 1)%MOD << endl;
    return 0;
}
```