#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
ll dp[10005][2][100];
string s;
ll n,d;
ll solve(ll pos,ll tight,ll mo)
{
    if(pos==n)
    {
        return (mo==0);
    }
    if(dp[pos][tight][mo]!=-1)
    return dp[pos][tight][mo];
    ll ret=0;
        ll up=(tight?(s[pos]-'0'):9);
        //cout<<up<<" ";
        for(ll di=0;di<=up;di++)
        {
            ret=(ret%mod+solve(pos+1,(tight&(di==up)),(mo+di)%d)%mod)%mod;
        }
    return dp[pos][tight][mo]=ret;
}
int main()
{
    cin>>s>>d;
    memset(dp,-1,sizeof dp);
    n=s.length();
    ll ans=solve(0,1,0);
    ans=(ans%mod-1+mod)%mod;
    cout<<ans<<endl;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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 ll long long int
#define mod 1000000007
ll dp[10005][2][100];
string s;
ll n,d;
ll solve(ll pos,ll tight,ll mo)
{
    if(pos==n)
    {
        return (mo==0);
    }
    if(dp[pos][tight][mo]!=-1)
    return dp[pos][tight][mo];
    ll ret=0;
        ll up=(tight?(s[pos]-'0'):9);
        //cout<<up<<" ";
        for(ll di=0;di<=up;di++)
        {
            ret=(ret%mod+solve(pos+1,(tight&(di==up)),(mo+di)%d)%mod)%mod;
        }
    return dp[pos][tight][mo]=ret;
}
int main()
{
    cin>>s>>d;
    memset(dp,-1,sizeof dp);
    n=s.length();
    ll ans=solve(0,1,0);
    ans=(ans%mod-1+mod)%mod;
    cout<<ans<<endl;
}

```