Roman is a young mathematician, very famous in Uzhland. Unfortunately, Sereja doesn't think so. To make Sereja change his mind, Roman is ready to solve any mathematical problem. After some thought, Sereja asked Roma to find, how many numbers are close to number n, modulo m.

Number x is considered close to number n modulo m, if:

  * it can be obtained by rearranging the digits of number n, 
  * it doesn't have any leading zeroes, 
  * the remainder after dividing number x by m equals 0. 



Roman is a good mathematician, but the number of such numbers is too huge for him. So he asks you to help him.

Input

The first line contains two integers: n (1 ≤ n < 1018) and m (1 ≤ m ≤ 100).

Output

In a single line print a single integer — the number of numbers close to number n modulo m.

Examples

Input

104 2


Output

3


Input

223 4


Output

1


Input

7067678 8


Output

47

Note

In the first sample the required numbers are: 104, 140, 410.

In the second sample the required number is 232.
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Queue;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
public class Main {
    String s;
    int m, n;
    long[][] dp = new long[N][105];
    int[] sum = new int[N], t = new int[30];
    int add(int x, int y){
        return (x+y)%m;
    }
    void work() throws Exception{
        s = Next(); m = Int();
        n = s.length();
        for(int i = 0; i < (1<<n); i++)for(int j = 0; j < m; j++)dp[i][j] = 0;
        t[0] = 1%m;
        for(int i = 1; i <= n; i++)t[i] = t[i-1]*10%m;
        dp[0][0] = 1;
        for(int i = 0; i < (1<<n); i++)
        {
            sum[i] = 0;
            for(int j = 0; j < n; j++)if((i&(1<<j))>0)sum[i] += s.charAt(j)-'0';
        }
        for(int i = 0; i < (1<<n); i++)
        {
            int num = 0; 
            for(int k = 0; k < n; k++)if((i&(1<<k))>0)num++;
            for(int j = 0; j < m; j++)
            {
                if(dp[i][j] == 0)continue;
                for(int k = 0; k < n; k++)
                    if((i&(1<<k))==0)
                    {
                        if(num == n-1 && s.charAt(k)=='0')continue;
                        int now = i + (1<<k);
                        dp[now][add(j, t[num]*(s.charAt(k)-'0'))] += dp[i][j];
                    }
            }
        }
        for(int i = 0; i < 10; i++)t[i] = 0;
        for(int i = 0; i < n; i++)t[s.charAt(i)-'0']++;
        for(int i = 0; i < 10; i++){
            long ans = 1;
            for(int j = 1; j <= t[i]; j++)ans *= j;
            dp[(1<<n)-1][0] /= ans;
        }
        out.println(dp[(1<<n)-1][0]);
    }

    public static void main(String[] args) throws Exception{
        Main wo = new Main();
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
  //    in = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
  //    out = new PrintWriter(new File("output.txt"));
        wo.work();
        out.close();
    }

    static int N = 300000;
    static int M = 101;
    DecimalFormat df=new DecimalFormat("0.0000");
    static int inf = (int)1e9;
    static long inf64 = (long) 1e18;
    static double eps = 1e-8;
    static double Pi = Math.PI;
    static int mod = (int)1e9 + 7 ;
    
    private String Next() throws Exception{
        while (str == null || !str.hasMoreElements())
            str = new StringTokenizer(in.readLine());
        return str.nextToken();
    }
    private int Int() throws Exception{
        return Integer.parseInt(Next());
    }
    private long Long() throws Exception{
        return Long.parseLong(Next());
    }
    private double Double() throws Exception{
        return Double.parseDouble(Next());
    }
    StringTokenizer str;
    static Scanner cin = new Scanner(System.in);
    static BufferedReader in;
    static PrintWriter out;
  /*  
    class Edge{
        int from, to, dis, nex;
        Edge(){}
        Edge(int from, int to, int dis, int nex){
            this.from = from;
            this.to = to;
            this.dis = dis;
            this.nex = nex;
        }
    }
    Edge[] edge = new Edge[M<<1];
    int[] head = new int[N];
    int edgenum;
    void init_edge(){for(int i = 0; i < N; i++)head[i] = -1; edgenum = 0;}
    void add(int u, int v, int dis){
        edge[edgenum] = new Edge(u, v, dis, head[u]);
        head[u] = edgenum++;
    }/**/
    int upper_bound(int[] A, int l, int r, int val) {// upper_bound(A+l,A+r,val)-A;
        int pos = r;
        r--;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (A[mid] <= val) {
                l = mid + 1;
            } else {
                pos = mid;
                r = mid - 1;
            }
        }
        return pos;
    }

    int Pow(int x, int y) {
        int ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            y >>= 1;
            x = x * x;
        }
        return ans;
    }
    double Pow(double x, int y) {
        double ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            y >>= 1;
            x = x * x;
        }
        return ans;
    }
    int Pow_Mod(int x, int y, int mod) {
        int ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            ans %= mod;
            y >>= 1;
            x = x * x;
            x %= mod;
        }
        return ans;
    }
    long Pow(long x, long y) {
        long ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            y >>= 1;
            x = x * x;
        }
        return ans;
    }
    long Pow_Mod(long x, long y, long mod) {
        long ans = 1;
        while (y > 0) {
            if ((y & 1) > 0)
                ans *= x;
            ans %= mod;
            y >>= 1;
            x = x * x;
            x %= mod;
        }
        return ans;
    }

    int gcd(int x, int y){
        if(x>y){int tmp = x; x = y; y = tmp;}
        while(x>0){
            y %= x;
            int tmp = x; x = y; y = tmp;
        }
        return y;
    }
    int max(int x, int y) {
        return x > y ? x : y;
    }

    int min(int x, int y) {
        return x < y ? x : y;
    }

    double max(double x, double y) {
        return x > y ? x : y;
    }

    double min(double x, double y) {
        return x < y ? x : y;
    }

    long max(long x, long y) {
        return x > y ? x : y;
    }

    long min(long x, long y) {
        return x < y ? x : y;
    }

    int abs(int x) {
        return x > 0 ? x : -x;
    }

    double abs(double x) {
        return x > 0 ? x : -x;
    }

    long abs(long x) {
        return x > 0 ? x : -x;
    }

    boolean zero(double x) {
        return abs(x) < eps;
    }
    double sin(double x){return Math.sin(x);}
    double cos(double x){return Math.cos(x);}
    double tan(double x){return Math.tan(x);}
    double sqrt(double x){return Math.sqrt(x);}
}