{"problem":{"name":"Chocolate Bar","description":{"content":"There is a bar of chocolate with a height of $H$ blocks and a width of $W$ blocks. Snuke is dividing this bar into exactly three pieces. He can only cut the bar along borders of blocks, and the shape ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc074_a"},"statements":[{"statement_type":"Markdown","content":"There is a bar of chocolate with a height of $H$ blocks and a width of $W$ blocks. Snuke is dividing this bar into exactly three pieces. He can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.\nSnuke is trying to divide the bar as evenly as possible. More specifically, he is trying to minimize $S_{max}$ - $S_{min}$, where $S_{max}$ is the area (the number of blocks contained) of the largest piece, and $S_{min}$ is the area of the smallest piece. Find the minimum possible value of $S_{max} - S_{min}$.\n\n## Constraints\n\n*   $2 ≤ H, W ≤ 10^5$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$H$ $W$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc074_a","tags":[],"sample_group":[["3 5","0\n\nIn the division below, $S_{max} - S_{min} = 5 - 5 = 0$.\n\n![image](https://atcoder.jp/img/arc074/2a9b2ef47b750c0b7ba3e865d4fb4203.png)"],["4 5","2\n\nIn the division below, $S_{max} - S_{min} = 8 - 6 = 2$.\n\n![image](https://atcoder.jp/img/arc074/a42aae7aaaadc4640ac5cdf88684d913.png)"],["5 5","4\n\nIn the division below, $S_{max} - S_{min} = 10 - 6 = 4$.\n\n![image](https://atcoder.jp/img/arc074/eb0ad0cb3185b7ae418e21c472ff7f26.png)"],["100000 2","1"],["100000 100000","50000"]],"created_at":"2026-03-03 11:01:13"}}