import qualified Data.IntMap as M

main :: IO ()
main = do
    [n, m] <- map read . words <$> getLine
    print $ solve n m

solve :: Int -> Int -> Int
solve n = foldr (%*%) 1 . map (\b -> comb (b + n - 1) b) . M.elems . factorization
    where x %*% y = (x * y) `mod` 1000000007

factorization :: Int -> M.IntMap Int
factorization 1 = M.empty
factorization n = M.insertWith (+) p 1 $ factorization (n `div` p)
    where p = head $ filter (\k -> n `mod` k == 0) [2 ..]

comb :: Int -> Int -> Int
comb n k
    | k < 0 = 0
    | k > n = 0
    | otherwise = fact n `div` (fact k * fact (n - k))

fact :: Int -> Int
fact 0 = 1
fact n = n * fact (n - 1)