It is required to determine whether it is possible from a chocolate bar of size n × m slices break off k slices, if it is allowed to make one break in a straight line between the slices (that is, break the chocolate bar into two rectangles).
Input
3 numbers are entered: n, m and k; k is not equal to n x times; m. It is guaranteed that the number of slices in a chocolate bar does not exceed 30000.
Imprint
The program should print the word YES if it is possible to break off the specified number of slices, otherwise print the word NO.
Examples
| # |
Input |
Output |
| 1 |
3
2
4 |
YES |
| 2 |
3
2
1 |
NO |