CF900D.Unusual Sequences

Count the number of distinct sequences $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}$ ) consisting of positive integers such that $gcd(a_{1},a_{2},...,a_{n})=x$ and . As this number could be large, print the answer modulo $10^{9}+7$ .

$gcd$ here means the greatest common divisor.

The only line contains two positive integers $x$ and $y$ ( $1<=x,y<=10^{9}$ ).

Print the number of such sequences modulo $10^{9}+7$ .

There are three suitable sequences in the first test: $(3,3,3)$ , $(3,6)$ , $(6,3)$ .

There are no suitable sequences in the second test.