#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
#define MOD 1000000007

template <class T> void add(T &a, T b) { a = (a + b) % MOD; }
ll dp[10005][2][105];

int main() {
  string K;
  int D;
  cin >> K >> D;
  int N = K.size();
  dp[0][0][0] = 1;
  rep(i, N) rep(j, 2) rep(k, D) {
    int x = j ? 9 : K[i] - '0';
    rep(d, x + 1) add(dp[i + 1][j || d < x][(k + d) % D], dp[i][j][k]);
  }
  ll ans = dp[N][0][0] + dp[N][1][0] - 1;
  if (ans < 0)
    ans += MOD;
  ans %= MOD;
  cout << ans << endl;
  return 0;
}

### Prompt

Generate 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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
#define MOD 1000000007

template <class T> void add(T &a, T b) { a = (a + b) % MOD; }
ll dp[10005][2][105];

int main() {
  string K;
  int D;
  cin >> K >> D;
  int N = K.size();
  dp[0][0][0] = 1;
  rep(i, N) rep(j, 2) rep(k, D) {
    int x = j ? 9 : K[i] - '0';
    rep(d, x + 1) add(dp[i + 1][j || d < x][(k + d) % D], dp[i][j][k]);
  }
  ll ans = dp[N][0][0] + dp[N][1][0] - 1;
  if (ans < 0)
    ans += MOD;
  ans %= MOD;
  cout << ans << endl;
  return 0;
}

```