#include <bits/stdc++.h>
using namespace std;
#define finish(x) reutrn cout << x << endl, 0;
#define ll long long
 //upsolve. other coder's code 
int d, dp[10001][101][2], mod = 1e9 + 7;
string k;
string c;
 
int solve(int ind, int cur, int b){
    if(ind == k.size()) return cur == 0;
    int &ret = dp[ind][cur][b];
    if(ret != -1) return ret;
    ret = 0;
    for(int i = 0 ; i <= (b == 0 ? k[ind] - '0' : 9) ; i++)
        ret = (ret + solve(ind + 1, (cur + i) % d, b || (i < k[ind] - '0'))) % mod;
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(dp, -1, sizeof dp);
    cin >> k >> d;
    cout << (solve(0, 0, 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>
using namespace std;
#define finish(x) reutrn cout << x << endl, 0;
#define ll long long
 //upsolve. other coder's code 
int d, dp[10001][101][2], mod = 1e9 + 7;
string k;
string c;
 
int solve(int ind, int cur, int b){
    if(ind == k.size()) return cur == 0;
    int &ret = dp[ind][cur][b];
    if(ret != -1) return ret;
    ret = 0;
    for(int i = 0 ; i <= (b == 0 ? k[ind] - '0' : 9) ; i++)
        ret = (ret + solve(ind + 1, (cur + i) % d, b || (i < k[ind] - '0'))) % mod;
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(dp, -1, sizeof dp);
    cin >> k >> d;
    cout << (solve(0, 0, 0) - 1 + mod) % mod << endl;
}
```