#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9+7;

int dp[10005][2][101];

int main(){
  string s;
  cin >> s;
  int d;
  cin >> d;
  int n = s.size();
  dp[0][0][0] = 1;
  rep(i,n) {
    const int P = s[i] - '0';
    rep(j,2) {
      rep(k,d) {
        for (int p = 0; p <= (j ? 9 : P); p++) {
          (dp[i+1][j || (p<P)][(k+p)%d] += dp[i][j][k]) %= mod;
        }
      }
    }
  }
  int res = (dp[n][0][0] + dp[n][1][0] - 1 + mod)%mod;
  cout << res << endl;//0の場合を引く
  return 0;
}
### Prompt

Your task is to create 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++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9+7;

int dp[10005][2][101];

int main(){
  string s;
  cin >> s;
  int d;
  cin >> d;
  int n = s.size();
  dp[0][0][0] = 1;
  rep(i,n) {
    const int P = s[i] - '0';
    rep(j,2) {
      rep(k,d) {
        for (int p = 0; p <= (j ? 9 : P); p++) {
          (dp[i+1][j || (p<P)][(k+p)%d] += dp[i][j][k]) %= mod;
        }
      }
    }
  }
  int res = (dp[n][0][0] + dp[n][1][0] - 1 + mod)%mod;
  cout << res << endl;//0の場合を引く
  return 0;
}
```