Carpeting the Room

2000ms

65536K

Description:

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 n₁.

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 n₁ (10 ≤ n ≤ 12, 1 ≤ k ≤ 10, $\text{[math]}$ ).

Output:

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

Sample Input:

10 4 6

Sample Output:

YES

Sample Input:

10 2 5

Sample Output:

NO

Informação

Provedor Codeforces

Código CF100A