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.

Input

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

Output

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

Note

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.