{"problem":{"name":"Remainder Minimization 2019","description":{"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$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc133_c"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $0 \\leq L < R \\leq 2 \\times 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$L$ $R$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc133_c","tags":[],"sample_group":[["2020 2040","2\n\nWhen $(i, j) = (2020, 2021)$, $(i \\times j) \\text{ mod } 2019 = 2$."],["4 5","20\n\nWe have only one choice: $(i, j) = (4, 5)$."]],"created_at":"2026-03-03 11:01:14"}}