Shil came across a weird equation and he wants to find out total number of solutions of this equation.The weird equation is :
x₁+ x₂ + x₃ ... x_N = D .
Find total number of solutions of this equation such that each x_i are non-negative and gcd of all the x_i is one.Here gcd stands for greatest common divisor.
Assume that gcd(0,y) = y for any y.

Input:
Only line of input consists of two integers N and D .

Output:
Output total number of solutions modulus 10⁹+7

Constraint:
1 ≤ N ≤ 10⁴
1 ≤ D ≤ 10⁴