#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll dp[200001][2][100];
int main(){
    string s;
    ll d,x,mod=1e9+7;
    cin>>s>>d;
    dp[0][1][0]=1;
    rep(i,s.size())rep(j,2)rep(k,d){
        if(j==0) x=9;
        else x=s[i]-'0';
        rep(l,x+1) (dp[i+1][j&&l==x][(k+l)%d]+=dp[i][j][k])%=mod;
    }
    cout<<(dp[s.size()][0][0]+dp[s.size()][1][0]-1+mod)%mod<<"\n";
}
### 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(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll dp[200001][2][100];
int main(){
    string s;
    ll d,x,mod=1e9+7;
    cin>>s>>d;
    dp[0][1][0]=1;
    rep(i,s.size())rep(j,2)rep(k,d){
        if(j==0) x=9;
        else x=s[i]-'0';
        rep(l,x+1) (dp[i+1][j&&l==x][(k+l)%d]+=dp[i][j][k])%=mod;
    }
    cout<<(dp[s.size()][0][0]+dp[s.size()][1][0]-1+mod)%mod<<"\n";
}
```