#include<fstream>
#include<algorithm>
using namespace std;
int v[20], v2[20], n=0;
inline long long giveN(){long long nr=0; for(int i=0; i<n; ++i) nr=nr*10+v[v2[i]]; return nr; } // se mai pot face optimizari pt. diferite valori al lui p
int main()
{
	long long aux, p, nr=0;
	ifstream f("ratphu.in");
	f>>aux>>p;
	while(aux)
	{
		v[n]=aux%10;
		v2[n]=n;
		aux/=10;
		++n;
	}
	sort(v, v+n);
	do{
		if(giveN()%p==0)
			++nr;
	}while(next_permutation(v2, v2+n));
	ofstream g("ratphu.out");
	g<<nr;
	g.close();
	return 0;
}