#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
vector<int>n;
long long dp[10009][2][109];

int main(){
  string s;
  int d;
  cin>>s>>d;

  int l=s.size();
  for(int i=0;i<l;i++){
    n.push_back(s[i]-'0');
  }

  dp[0][0][0]=1;
  for(int i=0;i<l;i++){
    for(int smaller=0;smaller<2;smaller++){
      for(int j=0;j<d;j++){
        for(int x=0;x<=(smaller?9:n[i]);x++){
          dp[i+1][smaller||x<n[i]][(j+x)%d] += dp[i][smaller][j];
          dp[i+1][smaller||x<n[i]][(j+x)%d] %= mod;
        }
      }
    }
  }

  cout<<(dp[l][0][0]+dp[l][1][0]-1+mod)%mod<<endl;

  return(0);
}

### Prompt

Please create a solution in CPP 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 mod 1000000007
vector<int>n;
long long dp[10009][2][109];

int main(){
  string s;
  int d;
  cin>>s>>d;

  int l=s.size();
  for(int i=0;i<l;i++){
    n.push_back(s[i]-'0');
  }

  dp[0][0][0]=1;
  for(int i=0;i<l;i++){
    for(int smaller=0;smaller<2;smaller++){
      for(int j=0;j<d;j++){
        for(int x=0;x<=(smaller?9:n[i]);x++){
          dp[i+1][smaller||x<n[i]][(j+x)%d] += dp[i][smaller][j];
          dp[i+1][smaller||x<n[i]][(j+x)%d] %= mod;
        }
      }
    }
  }

  cout<<(dp[l][0][0]+dp[l][1][0]-1+mod)%mod<<endl;

  return(0);
}

```