output_description: Print the minimum possible value of (i \times j) \mbox{ mod } 2019 when i and
  j are chosen under the given condition.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      L R
attempt: l, r = map(int, input().split())
  mod1 = []
  mod2 = []
  for i in range(l, r + 1):
      mod1.append(i % 2019)
  print(mod1)
  for i in range(len(mod1) - 1):
      for j in range(i + 1, len(mod1)):
          mod2.append((mod1[i] * mod1[j]) % 2019)
  print(mod2)
  print(min(mod2))
  
problem_description: 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.
samples: [{"input": "2020 2040", "output": "2\n    \n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\n* * *"}, {"input": "4 5", "output": "20\n    \n\nWe have only one choice: (i, j) = (4, 5)."}]