Shinchan loves eating toffees. He distributes the toffees in piles of equal size. Initially he has x toffees. Shinchan is wondering that if he had y times the number of toffees he initially had then how many different size of piles are possible in which he can distribute his toffees. Can you help shinchan in finding the number of different pile sizes in which he can distribute his toffees ?

Input consists of two numbers x and y.
Output should be the number of different possible pile sizes.

Constraints

1 <= x,y <= 1000000000

Sample Case

INPUT

6 3

OUTPUT

6