Problem:
Score : 300 points

Problem Statement

You are given two non-negative integers L and R.
We will choose two integers i and j such that L \leq i < j \leq R.
Find the minimum possible value of (i \times j) \mbox{ mod } 2019.

Constraints

All values in input are integers.

0 \leq L < R \leq 2 \times 10^9

Input

Input is given from Standard Input in the following format:

L R

Output

Print the minimum possible value of (i \times j) \mbox{ mod } 2019 when i and j are chosen under the given condition.

Sample Input 1

2020 2040

Sample Output 1

2

When (i, j) = (2020, 2021), (i \times j) \mbox{ mod } 2019 = 2.

Sample Input 2

4 5

Sample Output 2

20

We have only one choice: (i, j) = (4, 5).

Solution in Scala (2.11.7) (judge verdict: Wrong Answer)

object Main extends App {

  val arr: Array[Int] = scala.io.StdIn.readLine().split(" ").map(_.toInt)
  val l = arr(0)
  val r = arr(1)

  val list = for {
    i <- l to r
    j <- l to r
  } yield if(i < j || i != j) i * j else 0

  val list2 = list.toSet.filter(_ != 0)

  val ans = list2.map(v => v % 2019).min

  println(ans)



}