#include <iostream>
#include <string>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef __int64_t ll;

int m;

/* Returns the next state from st. */
int next_state(int st, char ch) {
  if (st == 2) { // fail
    return 2;
  }
  if (st == 1) { // "0"
    return 2; // This automaton never accepts string of form /0..*/
  }
  if (st == 0) { // init, ""
    if (ch == '0') {
      return 1; // "0"
    }
    return (ch - '0') % m + 3;
  }
  int q = st - 3;
  return (q * 10 + (ch - '0')) % m + 3;
}
const int M = 101000;
ll dp[2][M] = {};
const ll mod = 1e9 + 7;

int main(void){
  string s;
  cin >> s >> m;
  int len = s.length();
  if (len >= 20) {
    return 1; // RE
  }
  int cnt = 0;
  REP (bits, 1, 1 << len) {
    ll sum = 0;
    int zero = 0;
    REP (i, 0, len) {
      if (bits & (1 << i)) {
	sum *= 10;
	sum += s[i] - '0';
	sum %= m;
	if (s[i] == '0' && bits != (1 << i)) {
	  zero = 1;
	}
      }
    }
    cnt += sum == 0 && zero == 0;
  }
  cout << cnt << endl;
}