#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &A) {
  for (long long i = 0; i < A.size(); i++) os << A[i] << " ";
  os << endl;
  return os;
}
template <>
ostream &operator<<(ostream &os, const vector<vector<long long> > &A) {
  long long N = A.size();
  for (long long i = 0; i < N; i++) {
    for (long long j = 0; j < A[i].size(); j++) os << A[i][j] << " ";
    os << endl;
  }
  return os;
}
struct edge {
  long long from, to, d, c;
  edge(long long _from = 0, long long _to = 0, long long _d = 0,
       long long _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  long long x1, y1, x2, y2;
  aabb(long long x1, long long y1, long long x2, long long y2)
      : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
struct flow {
  long long to, cap, rev, cost;
  flow(long long to = 0, long long cap = 0, long long rev = 0,
       long long cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
const long long di[4] = {0, -1, 0, 1};
const long long dj[4] = {-1, 0, 1, 0};
const long long ci[5] = {0, 0, -1, 0, 1};
const long long cj[5] = {0, -1, 0, 1, 0};
const long long LINF = LLONG_MAX / 2;
const long long INF = INT_MAX / 2;
const long double PI = acos(-1);
long long pow2(long long n) { return 1LL << n; }
template <typename T, typename U>
bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U>
bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}
struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
long long N, M, K, T, Q, H, W;
signed main() {
  cin >> N >> M;
  vector<long long> d;
  while (N > 0) {
    d.push_back(N % 10);
    N /= 10;
  }
  N = d.size();
  vector<vector<long long> > dp(1 << N, vector<long long>(M, 0));
  dp[0][0] = 1;
  for (long long b = 0; b < (long long)(1 << N); b++)
    for (long long j = 0; j < (long long)(M); j++) {
      for (long long i = 0; i < (long long)(N); i++)
        if (((b >> i) & 1) == 0) {
          if (b == 0 && d[i] == 0) continue;
          long long nb = b | (1 << i);
          long long nj = (j * 10 + d[i]) % M;
          dp[nb][nj] += dp[b][j];
        }
    }
  vector<long long> F(100, 1);
  for (long long i = 0; i < (long long)(99); i++) F[i + 1] = F[i] * (i + 1);
  long long ans = dp[(1 << N) - 1][0];
  vector<long long> C(10, 0);
  for (long long i = 0; i < (long long)(N); i++) C[d[i]]++;
  for (long long i = 0; i < (long long)(10); i++) {
    ans /= F[C[i]];
  }
  cout << ans << endl;
  return 0;
}
