#include<iostream>
#include<cstring>
using namespace std;

#define MOD 1000000007

int n,d,s;
char k[10005];
int dp[10005][105];

int main(){

    cin>>(k+1)>>d;

    n=strlen(k+1);

    for(int i=1;i<=n;i++)
        k[i]-='0';

    for(int i=1;i<=n;i++){

        for(int r=0;r<d;r++){

            for(int c=0;c<10;c++){

                int rPred=(r-c+10*d)%d;

                dp[i][r]=(dp[i][r]+dp[i-1][rPred])%MOD;

            }

            for(int c=0;c<k[i];c++)
                if((s+c)%d==r)
                    ++dp[i][r];

        }

        s=(s+k[i])%d;
    }

    cout<<(dp[n][0]+(s==0)-1+MOD)%MOD;

}

### Prompt

Please formulate 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>
#include<cstring>
using namespace std;

#define MOD 1000000007

int n,d,s;
char k[10005];
int dp[10005][105];

int main(){

    cin>>(k+1)>>d;

    n=strlen(k+1);

    for(int i=1;i<=n;i++)
        k[i]-='0';

    for(int i=1;i<=n;i++){

        for(int r=0;r<d;r++){

            for(int c=0;c<10;c++){

                int rPred=(r-c+10*d)%d;

                dp[i][r]=(dp[i][r]+dp[i-1][rPred])%MOD;

            }

            for(int c=0;c<k[i];c++)
                if((s+c)%d==r)
                    ++dp[i][r];

        }

        s=(s+k[i])%d;
    }

    cout<<(dp[n][0]+(s==0)-1+MOD)%MOD;

}

```