#P458. 【例83.4】最大公约数和最小公倍数

【例83.4】最大公约数和最小公倍数

Description

Input two positive integers x0x_0,y0y_0, and find the number of pairs PP,QQ that satisfy the following conditions:

  1. PP,QQ are positive integers.
  2. PP,QQ must have x0x_0 as their greatest common divisor and y0y_0 as their least common multiple.
    Find the number of all possible pairs PP,QQ that satisfy these conditions.

Input Format

A single line containing two positive integers x0x_0,y0y_0.

Output Format

A single line containing one number, representing the number of pairs PP,QQ that satisfy the conditions.

Sample

3 60
4