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.*;
import java.util.*;

public class Solution{
	InputStream is;
	static PrintWriter out;
	String INPUT = "";
	static long mod = (long)1e9+7L;
	
	long[][] dp;
	long[] pow10;
	char[] a;
	int N;
	public void solve(){
		pow10 = new long[19];
		pow10[0] = 1;
		for(int i = 1; i < 19; i++){
			pow10[i] = pow10[i-1]*10;
		}
		a = ns().toCharArray();
		int m = ni(), n = a.length;
		N =n;
		int mask = (1<<n)-1;
		dp = new long[m][mask+1];
		for(int i = 0; i < m; i++)Arrays.fill(dp[i], -1);
		
		dp[0][mask] = 0;
		long[] ans = new long[10];
		for(int i = 0; i < n; i++){
			if(isSet(mask, i) && a[i] != '0' && ans[a[i]-'0'] == 0){
				//out.println(i);
				long tmp = (pow10[n-1]*(long)(a[i]-'0'))%(long)m;
				long res = f(i(tmp), reset(mask, i), n-1, m);
				ans[a[i] - '0'] = 1;
				dp[0][mask] += res;
				//out.println("res ="+ dp[0][mask]);
			}
		}
		//out.println(dp[0][1]);
		//out.println(dp[0][2]);
		out.println(dp[0][mask]);
	}
	long f(int m, int mask, int n, int M){
		//out.println("state "+m+" "+mask+" "+n);
		if(dp[m][mask] != -1)return dp[m][mask]; 
		if(n == 0 && (mask+m)%M == 0)return dp[m][mask] = 1;

		dp[m][mask] = 0;
		int[] ans = new int[10];
		for(int i = 0; i < N; i++){
			if(isSet(mask, i) && ans[a[i] - '0'] == 0){
				long tmp = (pow10[n-1]*(long)(a[i]-'0'))%(long)M;
//out.println("hj "+mask+" "+i+" "+tmp+" "+m);
				tmp = (tmp + m)%M;

				dp[m][mask] += f(i(tmp), reset(mask, i), n-1, M);
				ans[a[i]-'0'] = 1;
//out.println(m+" "+mask+" "+dp[m][mask]);
			}
		}

		return dp[m][mask];
	}
	int reset(int num, int idx){
		if(!isSet(num, idx))return num;
		int m = 1<<(N-idx-1);
		return (num ^ m);
	}
	boolean isSet(int num, int idx){
		int m = 1<<(N-idx-1);
		return (num|m) == num;
	}

	void run(){
		is = new DataInputStream(System.in);
		out = new PrintWriter(System.out);
		int t=1;while(t-->0)solve();
		out.flush();
	}
	public static void main(String[] args)throws Exception{new Solution().run();}
	long mod(long v, long m){if(v<0){long q=(Math.abs(v)+m-1L)/m;v=v+q*m;}return v%m;}
    long mod(long v){if(v<0){long q=(Math.abs(v)+mod-1L)/mod;v=v+q*mod;}return v%mod;}
	//Fast I/O code is copied from uwi code.
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	private int readByte(){
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	private String ns(){
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	private char[] ns(int n){
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	private char[][] nm(int n, int m){
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	private int[] na(int n){
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	private int ni(){
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	private long nl(){
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	static  int i(long x){return (int)Math.round(x);}
	static class Pair implements Comparable<Pair>{
		long fs,sc;
		Pair(long a,long b){
			fs=a;sc=b;
		}
		public int compareTo(Pair p){
			if(this.fs>p.fs)return 1;
			else if(this.fs<p.fs)return -1;
			else{
				return i(this.sc-p.sc);
			}
			//return i(this.sc-p.sc);
		}
		public String toString(){
			return "("+fs+","+sc+")";
		}	
	}
	
}