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

int main() {
  string K;
  int D;
  cin >> K >> D;

  static long long dp[10001][2][100] = {};
  dp[0][0][0] = 1;
  for (size_t i = 0; i < K.size(); ++i) {
    for (int j = 0; j < 2; ++j) {
      for (int k = 0; k < D; ++k) {
        for (int d = 0; d <= (j ? 9 : K[i] - '0'); ++d) {
          dp[i + 1][j || d < K[i] - '0'][(k + d) % D] =
              (dp[i + 1][j || d < K[i] - '0'][(k + d) % D] + dp[i][j][k]) %
              1000000007;
        }
      }
    }
  }

  long long ans = dp[K.size()][0][0];
  ans = (ans + dp[K.size()][1][0]) % 1000000007;
  ans = (ans + 1000000006) % 1000000007;
  cout << ans << endl;
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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() {
  string K;
  int D;
  cin >> K >> D;

  static long long dp[10001][2][100] = {};
  dp[0][0][0] = 1;
  for (size_t i = 0; i < K.size(); ++i) {
    for (int j = 0; j < 2; ++j) {
      for (int k = 0; k < D; ++k) {
        for (int d = 0; d <= (j ? 9 : K[i] - '0'); ++d) {
          dp[i + 1][j || d < K[i] - '0'][(k + d) % D] =
              (dp[i + 1][j || d < K[i] - '0'][(k + d) % D] + dp[i][j][k]) %
              1000000007;
        }
      }
    }
  }

  long long ans = dp[K.size()][0][0];
  ans = (ans + dp[K.size()][1][0]) % 1000000007;
  ans = (ans + 1000000006) % 1000000007;
  cout << ans << endl;
}
```