Soroush's room is a square with side length n. Before this contest he bought k fine Persian carpets to carpet his room for celebrating the 100th contest on his favorite site. Each Persian carpet is a square of side length n1.

Soroush wants to cover all the area of his room. Carpets can be put over each other but it is not allowed to rotate the carpets. Can Soroush carpet his room completely?

Input

The input consists of three integer numbers n, k and n1 (10 ≤ n ≤ 12, 1 ≤ k ≤ 10, $$\left\lceil \frac{n}{2} \right\rceil \leq n_1 \leq n$$).

Output

Write a single YES or NO. Write YES if and only if Sorush can carpet his room completely.

见题面 Input 部分

见题面 Output 部分