B. Pizza Slices
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are hosting a pizza party and have ordered $$$n\ (1 \leq n \leq 10^5)$$$ pizzas, each with 8 slices. There are $$$m\ (1 \leq m \leq 100)$$$ friends attending your party, and you want to distribute the pizza slices in a fair manner so that everyone receives the same number of slices. However, you do not want people to go home hungry: you want everyone to eat at least $$$k\ (1 \leq k \leq 10)$$$ slices.

Determine if it is possible to distribute the slices such that each friend receives the same number of slices and also does not go home hungry. Return true if this is possible, and false otherwise.

Input

The first line of input will contain a single integer $$$n$$$, the total number of pizzas. The second line of input will contain a single integer $$$m$$$, the total number of attendees at the party. The last line of input will contain a single integer $$$k$$$, the number of slices that you want everyone to eat.

Output

Determine if it is possible to distribute the slices such that each friend receives the same number of slices and also does not go home hungry. Print "TRUE" if it is possible to distribute the slices such that each friend receives the same number of slices and also does not go home hungry. Print "FALSE" otherwise.

Examples
Input
1
4
3
Output
FALSE
Input
1
4
2
Output
TRUE