#include<bits/stdc++.h>
using namespace std;
string s;
long long mod=1000000007;
int d;
int dp[2][100009][109];

int main(){
  cin >> s >> d;
  dp[0][0][0]=1;
  int n=s.size();
  for(int i=0;i<n;i++){
    for(int j=0;j<10;j++){
      for(int k=0;k<d;k++){
        dp[1][i+1][(k+j)%d]=(dp[1][i+1][(k+j)%d]+dp[1][i][k])%mod;
        if(j>s[i]-'0')continue;
        else if(j<s[i]-'0')dp[1][i+1][(k+j)%d]=(dp[1][i+1][(k+j)%d]+dp[0][i][k])%mod;
        else dp[0][i+1][(k+j)%d]=(dp[0][i+1][(k+j)%d]+dp[0][i][k])%mod;
      }
    }
  }
  long long k=(dp[0][n][0]+dp[1][n][0])%mod;
  if(k==0){k+=mod;}
  cout << k-1 << endl;
}
### Prompt

Develop a solution in Cpp to the problem described below:

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;
string s;
long long mod=1000000007;
int d;
int dp[2][100009][109];

int main(){
  cin >> s >> d;
  dp[0][0][0]=1;
  int n=s.size();
  for(int i=0;i<n;i++){
    for(int j=0;j<10;j++){
      for(int k=0;k<d;k++){
        dp[1][i+1][(k+j)%d]=(dp[1][i+1][(k+j)%d]+dp[1][i][k])%mod;
        if(j>s[i]-'0')continue;
        else if(j<s[i]-'0')dp[1][i+1][(k+j)%d]=(dp[1][i+1][(k+j)%d]+dp[0][i][k])%mod;
        else dp[0][i+1][(k+j)%d]=(dp[0][i+1][(k+j)%d]+dp[0][i][k])%mod;
      }
    }
  }
  long long k=(dp[0][n][0]+dp[1][n][0])%mod;
  if(k==0){k+=mod;}
  cout << k-1 << endl;
}
```