B'A chessboard n xe2 x80 x89 xc3 x97 xe2 x80 x89m in size is given. During the zero minute we repaint all the black squares to the 0 color. During the i-th minute we repaint to the i color the initially black squares that have exactly four corner-adjacent squares painted i xe2 x80 x89- xe2 x80 x891 (all such squares are repainted simultaneously). This process continues ad infinitum. You have to figure out how many squares we repainted exactly x times. The upper left square of the board has to be assumed to be always black. Two squares are called corner-adjacent, if they have exactly one common point. The first line contains integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895000). The second line contains integer x (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109). Print how many squares will be painted exactly x times.'...