#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main(){
  string K;
  cin >> K;
  int D;
  cin >> D;
  int L = K.size();
  vector<int> N(L);
  for (int i = 0; i < L; i++){
    N[i] = K[i] - '0';
  }
  vector<vector<vector<long long>>> dp(L + 1, vector<vector<long long>>(2, vector<long long>(D, 0)));
  dp[0][0][0] = 1;
  for (int i = 0; i < L; i++){
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < D; k++){
        for (int d = 0; d <= (j ? 9 : N[i]); d++){
          dp[i + 1][j | d < N[i]][(k + d) % D] = (dp[i + 1][j | d < N[i]][(k + d) % D] + dp[i][j][k]) % MOD;
        }
      }
    }
  }
  cout << (dp[L][0][0] + dp[L][1][0] + MOD - 1) % MOD;
}
### 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>
using namespace std;
long long MOD = 1000000007;
int main(){
  string K;
  cin >> K;
  int D;
  cin >> D;
  int L = K.size();
  vector<int> N(L);
  for (int i = 0; i < L; i++){
    N[i] = K[i] - '0';
  }
  vector<vector<vector<long long>>> dp(L + 1, vector<vector<long long>>(2, vector<long long>(D, 0)));
  dp[0][0][0] = 1;
  for (int i = 0; i < L; i++){
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < D; k++){
        for (int d = 0; d <= (j ? 9 : N[i]); d++){
          dp[i + 1][j | d < N[i]][(k + d) % D] = (dp[i + 1][j | d < N[i]][(k + d) % D] + dp[i][j][k]) % MOD;
        }
      }
    }
  }
  cout << (dp[L][0][0] + dp[L][1][0] + MOD - 1) % MOD;
}
```