Taco Serving Challenge

A local taco party is in full swing and you have invited N friends. However, you only have two types of taco slices available:

• Quarter slices: Each quarter slice is equivalent to 2 serving units. This means one quarter slice can serve 2 friends.
• Eighth slices: Each eighth slice counts as 1 serving unit, so it can serve 1 friend.

Your task is to decide whether you can serve all your friends with the available slices. In mathematical terms, if you have Q quarter slices and E eighth slices, then the total number of serving units is given by:

$$2Q + E \geq N$$

If the condition holds, output "YES"; otherwise, output "NO".

inputFormat

The input is provided via standard input (stdin) as a single line containing three space-separated integers: N (number of friends), Q (number of quarter slices), and E (number of eighth slices).

outputFormat

Output a single line to standard output (stdout): "YES" if it is possible to serve all friends, or "NO" otherwise.

5 1 8

YES