{"raw_statement":[{"iden":"problem statement","content":"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) \\text{ mod } 2019$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $0 \\leq L < R \\leq 2 \\times 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$L$ $R$"},{"iden":"sample input 1","content":"2020 2040"},{"iden":"sample output 1","content":"2\n\nWhen $(i, j) = (2020, 2021)$, $(i \\times j) \\text{ mod } 2019 = 2$."},{"iden":"sample input 2","content":"4 5"},{"iden":"sample output 2","content":"20\n\nWe have only one choice: $(i, j) = (4, 5)$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}