Given a chocolate bar of size n × m squares, determine if it is possible to break off exactly k squares with a single straight-line break between squares (splitting into two rectangles).

Three numbers are entered: n, m, and k; k is not equal to n × m. It is guaranteed that the total number of squares in the chocolate bar does not exceed 30,000.

Output "YES" if it is possible to break off the given number of squares, otherwise output "NO".

[{'input': '3\n2\n4', 'output': 'YES'}, {'input': '3\n2\n1', 'output': 'NO'}]