# Colded LCM

BUET Inter University Pro...
Limits 3s, 256 MB

Chris Martin is challenged with another problem. This time our favorite violinist Lindsey Stirling asked him to solve this problem. Lindsey will give Chris two integers $L$ and $R$, such that $L \lt R$. Chris has to find two integers $a$ and $b$, such that $L \le a \lt b \le R$, where LCM of $a$ and $b$ is as minimum as possible. Print this minimum value of LCM.

By definition, LCM or Least Common Multiple of two integers $x$ and $y$ is the minimum positive integer divisible by both $x$ and $y$.

## Input

First line of the input will be an integer $T$ $(1 \le T \le 2000)$, denoting number of testcases. Each of the next $T$ lines will contain two integers $L$ and $R$ $(1 \le L \lt R \le 10^9)$, denoting the numbers Lindsey gave to Chris in the corresponding testcase.

## Output

For each testcase, print the answer in one line.

## Sample

InputOutput
2
1 3
4 6

2
12


### Statistics

58% Solution Ratio
user.257439Earliest, 3M ago
nirjoy139Fastest, 0.0s
naeem4265Lightest, 5.5 kB
phe0nixShortest, 399B