#include <bits/stdc++.h>

using namespace std;

long long dp[10001][2][101];
const int mod = 1e9 + 7;

int main() {
    int m;
    string s;
    cin >> s >> m;

    int n = s.size(); 
    dp[n][1][0] = dp[n][0][0] = 1;
    for (int pos = n - 1; pos >= 0; pos--) 
        for (int flag = 0; flag < 2; ++flag) 
            for (int sum = 0; sum <= 100; ++sum) {
                int lim = flag ? s[pos] - '0' : 9;
                for (int i = 0; i <= lim; ++i) {
                    dp[pos][flag][sum] += dp[pos + 1][i == lim and flag][(sum + i) % m];
                    dp[pos][flag][sum] %= mod;
                }
            }

    cout << (dp[0][1][0] + mod - 1) % mod << "\n";

    return 0;
}

### Prompt

Create a solution in Cpp for 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>

using namespace std;

long long dp[10001][2][101];
const int mod = 1e9 + 7;

int main() {
    int m;
    string s;
    cin >> s >> m;

    int n = s.size(); 
    dp[n][1][0] = dp[n][0][0] = 1;
    for (int pos = n - 1; pos >= 0; pos--) 
        for (int flag = 0; flag < 2; ++flag) 
            for (int sum = 0; sum <= 100; ++sum) {
                int lim = flag ? s[pos] - '0' : 9;
                for (int i = 0; i <= lim; ++i) {
                    dp[pos][flag][sum] += dp[pos + 1][i == lim and flag][(sum + i) % m];
                    dp[pos][flag][sum] %= mod;
                }
            }

    cout << (dp[0][1][0] + mod - 1) % mod << "\n";

    return 0;
}

```