Problem:
Score : 400 points

Problem Statement

You are given positive integers N and M.

How many sequences a of length N consisting of positive integers satisfy a_1 \times a_2 \times ... \times a_N = M? Find the count modulo 10^9+7.

Here, two sequences a' and a'' are considered different when there exists some i such that a_i' \neq a_i''.

Constraints

All values in input are integers.

1 \leq N \leq 10^5

1 \leq M \leq 10^9

Input

Input is given from Standard Input in the following format:

N M

Output

Print the number of the sequences consisting of positive integers that satisfy the condition, modulo 10^9 + 7.

Sample Input 1

2 6

Sample Output 1

4

Four sequences satisfy the condition: \{a_1, a_2\} = \{1, 6\}, \{2, 3\}, \{3, 2\} and \{6, 1\}.

Sample Input 2

3 12

Sample Output 2

18

Sample Input 3

100000 1000000000

Sample Output 3

957870001

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)


import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static long N;
	public static long M;
	public static long divide = 1000000007;
	public static Map<Long, Long> div = new HashMap<>();

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		M = sc.nextLong();
		while(M != 1) {
			for(long i = 2; i < M + 1; i++) {
				if(M % i == 0) {
					if(div.containsKey(i)) {
						long value = div.get(i);
						div.put(i, value + 1);
					} else {
						div.put(i, 1l);
					}
					M /= i;
					break;
				}
			}
		}
		long ans = 0;
		for(Map.Entry<Long, Long> e : div.entrySet()) {
			ans = ((Calc(e.getValue(), 1) % divide) * ans) % divide;
		}
		System.out.println(ans);

	}

	public static long Calc(long num, long pos) {
		if(pos <= N || num == 0) {
			return 1;
		} else {
			long count = 0;
			for(long i = num; i > 0; i++) {
				count = (count + Calc(num - i, pos + 1)) % divide;
			}
			return count;
		}
	}

}