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 Julia (0.5.0) (judge verdict: Wrong Answer)

function main()
  
  (L,R) = map(x -> parse(Int,x), split(readline()))
  
  check1 = 10^10
  check2 = 0
  
  for i in L:R
    check1 = min(check1, i % 2019)
    check2 = max(check2, i % 2019)
  end
  
  ans = 10^10
  
  for i in check1:check2-1
    for j in i+1:check2
      ans = min(ans,i*j)
    end
  end
  
  println(ans)
  
end

main()