local mfl, mce = math.floor, math.ceil
local mod = 1000000007
local function badd(x, y) return (x + y) % mod end
local function bmul(x, y) return (x * y) % mod end

local function getprimes(x)
  local primes = {}
  local allnums = {}
  for i = 1, x do allnums[i] = true end
  for i = 2, x do
    if allnums[i] then
      table.insert(primes, i)
      local lim = mfl(x / i)
      for j = 2, lim do
        allnums[j * i] = false
      end
    end
  end
  return primes
end
local primes = getprimes(31623)

local function modpow(src, pow)
  local res = 1
  while 0 < pow do
    if pow % 2 == 1 then
      res = bmul(res, src)
      pow = pow - 1
    end
    src = bmul(src, src)
    pow = mfl(pow / 2)
  end
  return res
end

local function modinv(src)
  return modpow(src, mod - 2)
end

local fact = {1}
for i = 2, 101000 do
  fact[i] = bmul(fact[i - 1], i)
end

local function getComb(n, k)
  return bmul(fact[n], modinv(bmul(fact[k], fact[n - k])))
end

local n, m = io.read("*n", "*n")
local tm = m
local ret = 1
if n == 1 then
  print(1)
else
  for i = 1, #primes do
    local p = primes[i]
    if tm < p * p then break end
    local cnt = 0
    while tm % p == 0 do
      tm = tm // p
      cnt = cnt + 1
    end
    if 0 < cnt then
      ret = bmul(ret, getComb(n + cnt - 1, n - 1))
    end
  end
  if tm ~= 1 then
    ret = bmul(ret, n)
  end
  print(ret)
end
