#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
constexpr i64 MOD = 1e9 + 7;
 
int main() {
  string s;
  cin >> s;
  int N = s.size();
  int D;
  cin >> D;
  vector<vvi> dp(N + 1, vvi(2, vi(D)));
  dp[0][0][0] = 1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < D; k++) {
        for (int d = 0; d <= (j ? 9 : s[i] - '0'); d++) {
          (dp[i + 1][j | (d < s[i] - '0')][(k + d) % D] += dp[i][j][k]) %= MOD;
        }
      }
    }
  }
  cout << (dp[N][0][0] + dp[N][1][0] - 1 + MOD) % MOD << endl;
}
### 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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
constexpr i64 MOD = 1e9 + 7;
 
int main() {
  string s;
  cin >> s;
  int N = s.size();
  int D;
  cin >> D;
  vector<vvi> dp(N + 1, vvi(2, vi(D)));
  dp[0][0][0] = 1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < D; k++) {
        for (int d = 0; d <= (j ? 9 : s[i] - '0'); d++) {
          (dp[i + 1][j | (d < s[i] - '0')][(k + d) % D] += dp[i][j][k]) %= MOD;
        }
      }
    }
  }
  cout << (dp[N][0][0] + dp[N][1][0] - 1 + MOD) % MOD << endl;
}
```