Given GCD(a, b) is equal to G and LCM(a, b) is equal to L. The task is to find number of possible pairs (a, b).
First line consists of T test cases. Only line of test cases consists of 2 integers G and L.
Single line output, print the count of possible pairs.
1 <= T <= 100
1 <= G,L <= 1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.