#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

ifstream cin("ratphu.in");
ofstream cout("ratphu.out");

const int MAX = (1 << 18) + 17;

void solve(int p, int nr_cif, vector < vector < long long > > &dp, vector < int > &cif) {
  vector < int > powers(23);
  powers[0] = 1;
  for (int i = 1; i <= 21; i ++) {
    powers[i] = powers[i - 1] * 2;
  }

  dp[0][0] = 1ll;
  for (int i = 0; i < (1 << nr_cif + 1); i ++) {
    for (int j = 0; j <= nr_cif; j ++) {
      int bit = powers[j];
      if (i & bit) continue;
      for (int k = 0; k < p; k ++) {
        dp[i ^ bit][(k * 10 + cif[j]) % p] += dp[i][k];
      }
    } 
  }

  int index = (1 << nr_cif + 1) - 1;
  cout << dp[index][0] << '\n';
}

int main() {
  long long n;
  int p;
  cin >> n >> p;

  vector < int > cif(20);
  int cnt = -1;
  while (n) {
    cif[++ cnt] = n % 10ll;
    n /= 10ll;
  }

  vector < vector < long long > > dp(MAX, vector < long long > (23));
  solve(p, cnt, dp, cif);
}