Problem:
Score : 400 points

Problem 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}.

Constraints

2 ≤ H, W ≤ 10^5

Input

Input is given from Standard Input in the following format:

H W

Output

Print the minimum possible value of S_{max} - S_{min}.

Sample Input 1

3 5

Sample Output 1

0

In the division below, S_{max} - S_{min} = 5 - 5 = 0.

Sample Input 2

4 5

Sample Output 2

2

In the division below, S_{max} - S_{min} = 8 - 6 = 2.

Sample Input 3

5 5

Sample Output 3

4

In the division below, S_{max} - S_{min} = 10 - 6 = 4.

Sample Input 4

100000 2

Sample Output 4

1

Sample Input 5

100000 100000

Sample Output 5

50000

Solution in Kotlin (1.0.0) (judge verdict: Wrong Answer)

fun min(a: Long, b: Long, c: Long) = Math.min(a, Math.min(b, c))

fun max(a: Long, b: Long, c: Long) = Math.max(a, Math.max(b, c))

fun main(args: Array<String>) {
    val (h, w) = readLine()!!.split(' ').map(String::toLong)
    if (h % 3 == 0L || w % 3 == 0L) {
        println(0)
        return
    }
    val hhalf = h shr 1
    val d1 = (1 until w).map { x ->
        val s1 = x * h
        val s2 = (w - x) * hhalf
        val s3 = (w - x) * (h - hhalf)
        max(s1, s2, s3) - min(s1, s2, s3)
    }.min()!!
    val whalf = w shr 1
    val d2 = (1 until h).map { y ->
        val s1 = y * w
        val s2 = (h - y) * whalf
        val s3 = (h - y) * (w - whalf)
        max(s1, s2, s3) - min(s1, s2, s3)
    }.min()!!
    println(Math.min(d1, d2))
}