#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

using namespace std;

#define maxn (1 << 18) + 5

#define LL long long

LL m,f[maxn][105];

char ch[20];

bool vis[20];

int main()

{

    scanf("%s%lld", &ch, &m);

    int n = strlen(ch);

    f[0][0] = 1;

    int e = (1 << n);

    for(int i = 0 ; i < e ; i ++)

    {

        for(int j = 0 ; j < m ; j ++)

        {

            memset(vis, 0, sizeof vis);

            for(int k = 0 ; k < n ; k ++)

            {

                int x = ch[k] - '0';

                if(i & (1 << k)) continue;

                if(i == 0 && x == 0) continue;

                if(vis[x]) continue;

                vis[x] = 1;

                f[i|(1<<k)][(j*10+x)%m] += f[i][j];

            }

        }

    }

    cout<<f[e-1][0]<<endl;

    return 0;

}