#include <bits/stdc++.h>
using namespace std;

int main() {
    long long mod = 1e9 + 7;
    string K;
    int D;
    cin >> K >> D;
    long long dp[K.size() + 1][2][D + 1];
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int i = 0; i < K.size(); ++i) {
        for (int j = 0; j <= 1; ++j) {
            int lim = j ? 9 : K[i] - '0';
            for (int k = 0; k < D; ++k) {
                for (int l = 0; l <= lim; ++l) {
                    (dp[i + 1][j || l < lim][(k + l) % D] += dp[i][j][k]) %= mod;
                }
            }
        }
    }
    cout << (dp[K.size()][0][0] + dp[K.size()][1][0] - 1 + mod) % mod << endl;

    return 0;
}
### Prompt

Develop a solution in Cpp 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>
using namespace std;

int main() {
    long long mod = 1e9 + 7;
    string K;
    int D;
    cin >> K >> D;
    long long dp[K.size() + 1][2][D + 1];
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int i = 0; i < K.size(); ++i) {
        for (int j = 0; j <= 1; ++j) {
            int lim = j ? 9 : K[i] - '0';
            for (int k = 0; k < D; ++k) {
                for (int l = 0; l <= lim; ++l) {
                    (dp[i + 1][j || l < lim][(k + l) % D] += dp[i][j][k]) %= mod;
                }
            }
        }
    }
    cout << (dp[K.size()][0][0] + dp[K.size()][1][0] - 1 + mod) % mod << endl;

    return 0;
}
```