Matches

Sean scattered matches all over his bedroom floor.

His mother was not pleased and told him to put every match into a box. Sean soon noticed that not all of the matches on the floor fit in the box, so he decided to take the ones that do not fit and throw them into the neighbour's garbage, where his mother will not find them.

Decide which matches fit in the box his mother gave him. A match fits in the box when its whole length can lie on the bottom of the box. Sean checks the matches one at a time.

The first line contains the number of matches on the floor $N$ ($1 \le N \le 50$) and the two side lengths of the bottom of the box, $W$ and $H$ ($1 \le W \le 100$, $1 \le H \le 100$).

Each of the next $N$ lines contains the length of one match, an integer between $1$ and $1000$.

For each match, in the order given in the input, print YES if it fits in the box and NO if it does not, one answer per line.