Colded LCM

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 LLL and RRR, such that L<RL \lt RL<R. Chris has to find two integers aaa and bbb, such that L≤a<b≤RL \le a \lt b \le RL≤a<b≤R, where LCM of aaa and bbb is as minimum as possible. Print this minimum value of LCM.

This is a companion discussion topic for the original entry at