import java.io.*; import java.math.*; import java.util.*; import java.util.Map.Entry; import static java.util.Arrays.*; public class _473 { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { int n = io.nextInt(); int X = io.nextInt() + 1; // for (int i = 2; i*i <= X; i++) { // if (X % i == 0) { // divisor.add(i); // if (i*i != X) divisor.add(X/i); // } // } // Collections.sort(divisor); Counter t = new Counter<>(); t.add(X); dfs(t, n - 1); // io.out.println(dfs(divisor.size() - 1, n - 1, X)); io.out.println(ans); } } Map memo = new TreeMap<>(); List divisor = new ArrayList<>(); int dfs(int idx, int num, long cur) { if (idx < 0 || cur == 1) return 0; if (num == 0) return 1; long key = cur * 1000 + num; if (memo.containsKey(key)) return memo.get(key); int ans = dfs(idx - 1, num, cur); if (cur % divisor.get(idx) == 0) { ans += dfs(idx, num - 1, cur / divisor.get(idx)); } memo.put(key, ans); return ans; } Set vis = new HashSet<>(); int ans; void dfs(Counter counter, int n) { final long h = counter.hash(); if (vis.add(h)) { if (n == 0) { ans++; return; } if (counter.valueCount() == 0) { return; } Entry e = counter.pollLastEntry(); final int x = e.getKey(); counter.add(x, e.getValue() - 1); if (n - rec2(x) <= 0) { for (int ys : rec(x)) { final int k1 = ys; final int k2 = x/ys; if (!rec(k1).isEmpty()) counter.add(k1); if (!rec(k2).isEmpty()) counter.add(k2); dfs(counter, n - 1); if (!rec(k1).isEmpty()) counter.remove(k1); if (!rec(k2).isEmpty()) counter.remove(k2); } } counter.add(e.getKey(), 1); } } Map mp2 = new HashMap<>(); int rec2(int x) { if (mp2.containsKey(x)) return mp2.get(x); int ans = 0; for (int i : rec(x)) { ans = Math.max(ans, rec2(i) + rec2(x/i) + 1); } mp2.put(x, ans); return ans; } Map> mp = new HashMap<>(); List rec(int x) { if (mp.containsKey(x)) return mp.get(x); List res = new ArrayList<>(); for (int i = 2; i*i <= x+1; i++) { if (x%i == 0) { res.add(i); } } mp.put(x, res); return res; } static class Counter> implements Comparable> { final Random random = new Random(); TreeMap mp = new TreeMap<>(); Map hashMaps = new HashMap<>(); long hash; int valueCount; public void add(T key) { update(key, 1); } public void add(T key, int cnt) { update(key, cnt); } public void remove(T key) { update(key, -1); } public void remove(T key, int cnt) { update(key, -cnt); } public Set> entrySet() { return mp.entrySet(); } public Set keySet() { return mp.keySet(); } public int valueCount() { return valueCount; } public long hash() { return hash; } public Entry pollLastEntry() { Entry e = mp.pollLastEntry(); updateHash(e.getKey(), -e.getValue()); return e; } public Entry pollFirstEntry() { Entry e = mp.pollFirstEntry(); updateHash(e.getKey(), -e.getValue()); return e; } public void update(T key, int cnt) { Integer boxed = mp.get(key); int v = boxed == null ? 0 : boxed; if (v + cnt < 0) cnt = -v; if (cnt == 0) { return; } if (v + cnt == 0) { mp.remove(key); } else { mp.put(key, v + cnt); } updateHash(key, cnt); } public void updateHash(T key, int cnt) { Long h = hashMaps.get(key); if (h == null) hashMaps.put(key, h = random.nextLong()); hash += h * cnt; valueCount += cnt; } @Override public int compareTo(Counter arg0) { if (mp.size() != arg0.mp.size()) return mp.size() - arg0.mp.size(); TreeMap x = new TreeMap<>(mp); TreeMap y = new TreeMap<>(arg0.mp); while (true) { Entry vx = x.pollFirstEntry(); Entry vy = y.pollFirstEntry(); if (!vx.getKey().equals(vy.getKey())) return vx.getKey().compareTo(vy.getKey()); if (!vx.getValue().equals(vy.getValue())) return vx.getValue().compareTo(vy.getValue()); if (x.isEmpty()) return 0; } } @Override public String toString() { return mp.toString(); } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new _473().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private InputStream in = System.in; private PrintWriter out = new PrintWriter(System.out); private static int pos, readLen; private static final byte[] buffer = new byte[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public byte read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { byte first = (byte)nextChar(); boolean minus = false; int res = 0; if (first == '-') { minus = true; } else { res = first - '0'; } while (true) { byte b = read(); if (isSpace[b]) break; res = res * 10 + b - '0'; } return minus ? -res : res; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } // public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } // public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public double nextDouble() throws IOException { double res = nextChar() - '0'; while (true) { byte c = read(); if (isSpace[c]) return res; if (c == '.') break; res = res * 10 + c - '0'; } double d = 1; while (true) { byte c = read(); // dump(c); if (!isDigit[c]) break; res = res * 10 + c - '0'; d *= 10; } // dump(1); return res / d; } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }