#include<bits/stdc++.h>
#define long long long
using namespace std;
const int N=1e6;
const long mod=1e9+7;
string s;int d;long dp[10002][102][2];
long dfs(int st,int md,int ck)
{
  if(st>=s.size())return !md;
  if(dp[st][md][ck]!=-1)return dp[st][md][ck];
  int x=s[st]-'0';long now=0;
  if(!ck)
  {
    for(int i=0;i<=9;i++)
      now=(now+dfs(st+1,(md+i)%d,0))%mod;
  }
  else
  {
    for(int i=0;i<x;i++)
      now=(now+dfs(st+1,(md+i)%d,0))%mod;
    now=(now+dfs(st+1,(md+x)%d,1))%mod;
  }
  return dp[st][md][ck]=now;
}
int main()
{
  ios_base::sync_with_stdio(0);cin.tie(0);
  cin>>s>>d;memset(dp,-1,sizeof(dp));
  cout<<(dfs(0,0,1)-1+mod)%mod<<endl;

  return 0;
}
### 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>
#define long long long
using namespace std;
const int N=1e6;
const long mod=1e9+7;
string s;int d;long dp[10002][102][2];
long dfs(int st,int md,int ck)
{
  if(st>=s.size())return !md;
  if(dp[st][md][ck]!=-1)return dp[st][md][ck];
  int x=s[st]-'0';long now=0;
  if(!ck)
  {
    for(int i=0;i<=9;i++)
      now=(now+dfs(st+1,(md+i)%d,0))%mod;
  }
  else
  {
    for(int i=0;i<x;i++)
      now=(now+dfs(st+1,(md+i)%d,0))%mod;
    now=(now+dfs(st+1,(md+x)%d,1))%mod;
  }
  return dp[st][md][ck]=now;
}
int main()
{
  ios_base::sync_with_stdio(0);cin.tie(0);
  cin>>s>>d;memset(dp,-1,sizeof(dp));
  cout<<(dfs(0,0,1)-1+mod)%mod<<endl;

  return 0;
}
```