#include<bits/stdc++.h>
using namespace std;
long long dp[10005][101][2],mod=1000000007;
string k;
long long solve(int i,int n ,int su,bool tight,int d){
    if(i==n){
        return su==0;
    }
    if(dp[i][su][tight]!=-1)
        return dp[i][su][tight];
    int mx=(tight?k[i]-'0':9);
    long long ans=0;
    for(int j=0;j<=mx;j++){
        ans=(ans%mod+solve(i+1,n,(su+j)%d,tight&(j==mx),d)%mod)%mod;
    }
    dp[i][su][tight]=ans;
    return ans;
}
 
int main(){
 
long long d;
cin>>k;
cin>>d;
 
memset(dp,-1,sizeof(dp));
cout<<(solve(0,k.size(),0,1,d)-1+mod)%mod<<"\n";
 
 
}
### 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 dp[10005][101][2],mod=1000000007;
string k;
long long solve(int i,int n ,int su,bool tight,int d){
    if(i==n){
        return su==0;
    }
    if(dp[i][su][tight]!=-1)
        return dp[i][su][tight];
    int mx=(tight?k[i]-'0':9);
    long long ans=0;
    for(int j=0;j<=mx;j++){
        ans=(ans%mod+solve(i+1,n,(su+j)%d,tight&(j==mx),d)%mod)%mod;
    }
    dp[i][su][tight]=ans;
    return ans;
}
 
int main(){
 
long long d;
cin>>k;
cin>>d;
 
memset(dp,-1,sizeof(dp));
cout<<(solve(0,k.size(),0,1,d)-1+mod)%mod<<"\n";
 
 
}
```