output_description: Print the minimum possible value of S_{max} - S_{min}.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H W
attempt: n = input()
  tmp_n = n.split(" ")
  
  h = int(tmp_n[0])
  w = int(tmp_n[1])
  
  if h % 3 == 0 or w % 3 == 0:
      print("0")
  else:
      len_area1 = int(max(h, w) / 3) + 1
      len_area2 = int(max(h, w) / 3)
  
      tmp_area_a1 = min(h, w) * len_area1
      tmp_area_a111 = (max(h, w) - len_area1) * int(min(h, w) / 2)
      tmp_area_a112 = (max(h, w) - len_area1) * int(min(h, w) / 2 + 1)
      tmp_area_aa = max(
          abs(tmp_area_a1 - tmp_area_a111),
          abs(tmp_area_a1 - tmp_area_a112),
          abs(tmp_area_a111 - tmp_area_a112),
      )
      tmp_area_a121 = int((max(h, w) - len_area1) / 2) * min(h, w)
      tmp_area_a122 = int((max(h, w) - len_area1) / 2 + 1) * min(h, w)
      tmp_area_ab = max(
          abs(tmp_area_a1 - tmp_area_a121),
          abs(tmp_area_a1 - tmp_area_a122),
          abs(tmp_area_a121 - tmp_area_a122),
      )
  
      tmp_area_b1 = min(h, w) * len_area2
      tmp_area_b111 = (max(h, w) - len_area2) * int(min(h, w) / 2)
      tmp_area_b112 = (max(h, w) - len_area2) * int(min(h, w) / 2 + 1)
      tmp_area_ba = max(
          abs(tmp_area_b1 - tmp_area_b111),
          abs(tmp_area_b1 - tmp_area_b112),
          abs(tmp_area_b111 - tmp_area_b112),
      )
      tmp_area_b121 = int((max(h, w) - len_area2) / 2) * min(h, w)
      tmp_area_b122 = int((max(h, w) - len_area2) / 2 + 1) * min(h, w)
      tmp_area_bb = max(
          abs(tmp_area_b1 - tmp_area_b121),
          abs(tmp_area_b1 - tmp_area_b122),
          abs(tmp_area_b121 - tmp_area_b122),
      )
  
      tmp_dis1 = min(tmp_area_aa, tmp_area_ab)
      tmp_dis2 = min(tmp_area_ba, tmp_area_bb)
      dis_area = min(tmp_dis1, tmp_dis2)
      print(dis_area)
  
problem_description: Statement
  
  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.
  
  Snuke 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}.
samples: [{"input": "3 5", "output": "0\n    \n\nIn the division below, S_{max} - S_{min} = 5 - 5 = 0.\n\n![2a9b2ef47b750c0b7ba3e865d4fb4203.png](https://atcoder.jp/img/arc074/2a9b2ef47b750c0b7ba3e865d4fb4203.png)\n\n* * *"}, {"input": "4 5", "output": "2\n    \n\nIn the division below, S_{max} - S_{min} = 8 - 6 = 2.\n\n![a42aae7aaaadc4640ac5cdf88684d913.png](https://atcoder.jp/img/arc074/a42aae7aaaadc4640ac5cdf88684d913.png)\n\n* * *"}, {"input": "5 5", "output": "4\n    \n\nIn the division below, S_{max} - S_{min} = 10 - 6 = 4.\n\n![eb0ad0cb3185b7ae418e21c472ff7f26.png](https://atcoder.jp/img/arc074/eb0ad0cb3185b7ae418e21c472ff7f26.png)\n\n* * *"}, {"input": "100000 2", "output": "1\n    \n\n* * *"}, {"input": "100000 100000", "output": "50000"}]