#include <bits/stdc++.h> 
using namespace std;
using ll=long long;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll dp[10001][2][101];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string k;
cin>>k;
int d;
cin>>d;
dp[0][0][0]=1;
for(int i=0;i<k.size();i++){
     int tmp=k[i]-'0';
     for(int j=0;j<2;j++){
      for(int l=0;l<d;l++){
         for(int r=0;r<(j?10:tmp+1);r++){
             (dp[i+1][j||(j!=1&&tmp!=r)][(l+r)%d]+=dp[i][j][l])%=mod;
            }
        }
     }
 }
cout<<(dp[k.size()][0][0]+dp[k.size()][1][0]-1+mod)%mod <<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;
using ll=long long;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll dp[10001][2][101];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string k;
cin>>k;
int d;
cin>>d;
dp[0][0][0]=1;
for(int i=0;i<k.size();i++){
     int tmp=k[i]-'0';
     for(int j=0;j<2;j++){
      for(int l=0;l<d;l++){
         for(int r=0;r<(j?10:tmp+1);r++){
             (dp[i+1][j||(j!=1&&tmp!=r)][(l+r)%d]+=dp[i][j][l])%=mod;
            }
        }
     }
 }
cout<<(dp[k.size()][0][0]+dp[k.size()][1][0]-1+mod)%mod <<endl;
}

```