SOLVE
LATER
You are given two integers n, and m.
Find the number of sequences of length n such that:
All elements of the sequence are positive divisors of m
For any two adjacent elements of the sequence, say p and q, there exists at least one prime which divides both p and q
Print this number modulo \( 10^9 + 7 \)
Input
The first line of the input contains two integers, n, and m respectively.
Output
Print the number of valid sequences modulo \(10^9 + 7\)
Constraints
\( 1 \le n \le 10^5 \)
\( 1 \le m \le 10^{18} \)