#include<cstdio>
#include<cstring>
using namespace std;
char s[10005];int n,f[10005][105][2],len,mod=1000000007;
int dfs(int nw,int res,int lim){
    int ans=0,&me=f[nw][res][lim];
    if(f[nw][res][lim]!=-1) return me;
    if(nw==len) return me=(res==0);
    int up=lim?(s[nw]-48):9;
    for(int i=0;i<=up;i++)
    ans=(ans+dfs(nw+1,(res+i)%n,lim&&(i==up)))%mod;
    return me=ans;
}
int main()
{
    scanf("%s%d",s,&n);
    len=strlen(s);
    memset(f,-1,sizeof(f));
    printf("%d",(dfs(0,0,1)-1+mod)%mod);
    return 0;
}
### 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<cstdio>
#include<cstring>
using namespace std;
char s[10005];int n,f[10005][105][2],len,mod=1000000007;
int dfs(int nw,int res,int lim){
    int ans=0,&me=f[nw][res][lim];
    if(f[nw][res][lim]!=-1) return me;
    if(nw==len) return me=(res==0);
    int up=lim?(s[nw]-48):9;
    for(int i=0;i<=up;i++)
    ans=(ans+dfs(nw+1,(res+i)%n,lim&&(i==up)))%mod;
    return me=ans;
}
int main()
{
    scanf("%s%d",s,&n);
    len=strlen(s);
    memset(f,-1,sizeof(f));
    printf("%d",(dfs(0,0,1)-1+mod)%mod);
    return 0;
}
```