GCD and LCM#1244
Given two positive integers and . Find the number of pairs of numbers , for which is the \mathrm{GCD}(P, Q), and is the \mathrm{LCM}(P, Q).
A single line contains two positive integers and (A < 10^5, B \leq 10^6).
Output a single number — the required number of pairs.
Example 1