Solve this question

Question

You are given two positive integers XX and KK.

You have to output the minimum and maximum value of LCM(i,j)LCM(i,j) where X≤i<j≤X⋅KX≤i<j≤X⋅K.

We define LCM(i,j)LCM(i,j) for two positive integers ii and jj as the minimum positive integer yy such that both ii and jj divide yy without remainder.

Input Format

First line will contain TT, number of testcases. Then the testcases follow.Each testcase contains of a single line of input, two space separated integers XX and KK.

Output Format

For each testcase, output two space separated integers - the minimum and maximum possible value respectively of LCM(i,j)LCM(i,j) where X≤i<j≤X⋅KX≤i<j≤X⋅K.

Constraints

1≤T≤1051≤T≤1051≤X≤1081≤X≤1082≤K≤1082≤K≤108It is guaranteed that, for each test case, X⋅K≤109X⋅K≤109

Sample Input 1 

2 4 3 2 3

Sample Output 1 

8 132 4 30

Explanation

Test Case 11: We want to find the minimum and maximum value of LCM(i,j)LCM(i,j) for 4≤i<j≤124≤i<j≤12. It is easy to verify that the LCM(4,8)=8LCM(4,8)=8 is the minimum possible value wherea

Answer 1

Post your code

Answer 2

I have no idea on this problem

Answer 3

https://www.sololearn.com/Content-Creation-Guidelines/

https://code.sololearn.com/Wv5gTHy1N6Ji/?ref=app
https://www.sololearn.com/discuss/1316935/?ref=app