Box of chocolate#4203
The "Black Triangle" factory produces signature chocolates in the form of isosceles right triangles, available in two sizes: one with a leg length of cm and another with a leg length of cm. These chocolates are then packaged into square boxes of various standard sizes. At the end of today's workday, there is one remaining square box with a side length of cm, along with chocolates of the first type and chocolates of the second type.
Your task is to determine whether it is possible to pack all these chocolates into the box such that they completely cover the bottom in a single layer without any gaps or overlaps, and without leaving any chocolates unused. Note that cutting the chocolates is not allowed.
The input consists of a single line containing three non-negative integers , , and , separated by spaces, where 1 \leq N \leq 10000, K \leq 10^9, and M \leq 10^9.
Output YES if it is possible to pack the chocolates as described, otherwise output NO.
Example 1