#include <iostream>
using namespace std;

typedef long long ll;
int n,d;
string k;
ll p=1e9+7,dp[10000][100];
ll f(int x, int s, bool b){
    if(x==n){
        if(s%d==0)return 1;
        return 0;
    }
    int y=k[x]-'0',u=9,r=0;
    if(b)u=y;
    else if(dp[x][s]!=-1)return dp[x][s];
    for(int i=0;i<=u;i++){
        r=(r+f(x+1,(s+i)%d,b&&i==u))%p;
    }
    if(!b)dp[x][s]=r;
    return r;
}

int main() {
    cin>>k>>d;
    n=k.length();
    for(int i=0;i<n;i++){
        for(int j=0;j<100;j++){
            dp[i][j]=-1;
        }
    }
    ll ans=(f(0, 0, true)-1+p)%p;
    cout<<ans<<endl;
	return 0;
}

### Prompt

Your challenge is to write 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 <iostream>
using namespace std;

typedef long long ll;
int n,d;
string k;
ll p=1e9+7,dp[10000][100];
ll f(int x, int s, bool b){
    if(x==n){
        if(s%d==0)return 1;
        return 0;
    }
    int y=k[x]-'0',u=9,r=0;
    if(b)u=y;
    else if(dp[x][s]!=-1)return dp[x][s];
    for(int i=0;i<=u;i++){
        r=(r+f(x+1,(s+i)%d,b&&i==u))%p;
    }
    if(!b)dp[x][s]=r;
    return r;
}

int main() {
    cin>>k>>d;
    n=k.length();
    for(int i=0;i<n;i++){
        for(int j=0;j<100;j++){
            dp[i][j]=-1;
        }
    }
    ll ans=(f(0, 0, true)-1+p)%p;
    cout<<ans<<endl;
	return 0;
}

```