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<R. Chris has to find two integers a and b, such that L≤a<b≤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≤T≤2000), denoting number of testcases. Each of the next T lines will contain two integers L and R(1≤L<R≤109), denoting the numbers Lindsey gave to Chris in the corresponding testcase.