#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

long long dp[(1<<18)][20];

int main()
{
    int P,a[30],i,k,t,N;
    char s[30];
    freopen ("ratphu.in","r",stdin);
    freopen ("ratphu.out","w",stdout);
    scanf("%s%d", (s+1),&P);
    N=strlen(s+1);
    for(i=1;i<=N;++i)
        a[i]=s[i]-'0';
    for(i=1;i<=N;++i)
        dp[(1<<(N-i))][a[i]%P]=1;
    for(i=1;i<(1<<N);++i)
    {
        if(!(i&(i-1)))
            continue;
        for(t=1;t<=N;++t)
            if((1<<(N-t))&i)
                for(k=0;k<P;++k)
                    dp[i][(k*10+a[t])%P]+=dp[i-(1<<(N-t))][k];
    }
    printf("%lld\n", dp[(1<<N)-1][0]);
    return 0;
}