using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
    void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }

    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;
        var L = new List<int>();
        int K = M;
        int sum = 0;
        for (int i = 2; i * i <= M; i++)
        {
            if (K % i == 0)
            {
                int cnt = 0;
                while (K % i == 0)
                {
                    K /= i;
                    cnt++;
                    sum++;
                }
                L.Add(cnt);
            }
        }
        if (K > 1)
        {
            L.Add(1);
            sum++;
        }
        long ans = 1;
        foreach (var item in L)
        {
            var dp = new long[item + 1];
            dp[0] = 1;


            for (int i = 0; i < N; i++)
            {
                var next = new long[item + 1];
                for (int j = 0; j < item + 1; j++)
                {
                    for (int k = 0; k < item + 1; k++)
                    {
                        if (j + k < item + 1)
                        {
                            next[j + k] += dp[k];
                            next[j + k] %= mod;
                        }
                    }
                }
                for (int j = 0; j < item + 1; j++)
                {
                    dp[j] = next[j];
                }
            }

            ans *= dp[item];
            ans %= mod;
 
        }
        WriteLine(ans);
        //var A = L.ToArray();
        //WriteLine(string.Join(" ", A));




        //table(N);
        //var ret = powmod(N, sum, mod);
        //WriteLine(ret);
        //foreach (var item in L)
        //{
        //    ret = ret * B[item] % mod;
        //}
        //WriteLine(ret);
    }

    long[] A, B;
    //a^b(mod p) solution works in O(logb).
    long powmod(long a, long b, long p)
    {
        if (b == 0) return 1;
        if (b % 2 == 0)
        {
            long d = powmod(a, b / 2, p);
            return d * d % p;
        }
        else
        {
            return a * powmod(a, b - 1, p) % p;
        }
    }
    void table(int n)
    {
        A = new long[n + 1];
        B = new long[n + 1];
        A[0] = 1;
        for (int i = 0; i < n; i++)
        {
            A[i + 1] = A[i] * (i + 1) % mod;
        }
        B[n] = powmod(A[n], mod - 2, mod);
        for (int i = 0; i < n; i++)
        {
            B[n - i - 1] = B[n - i] * (n - i) % mod;
        }
    }
    long combi(int n, int r)
    {
        return A[n] * B[r] % mod * B[n - r] % mod;
    }
}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}

Measured memory_bytes: 17340