Min Max LCM

You are given two positive integers $X$ and $K$. You have to output the minimum and maximum value of $LCM(i, j)$ where $X \leq i \lt j \leq X \cdot K$. We define $LCM(i, j)$ for two positive integers $i$ and $j$ as the minimum positive integer $y$ such that both $i$ and $j$ divide $y$ without remainder. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. -