### COCI 2006/2007, Contest #4

## Task SIBICE

Young Mirko threw matches all over the floor of his room.

His mom did not like that and ordered him to put all the matches in a box. Mirko soon noticed that not all of the matches on the floor fit in the box, so he decided to take the matches that don't fit and throw them in the neighbour's garbage, where his mom (hopefully) won't find them.

Help Mirko determine which of the matches fit in the box his mom gave him. A match fits in the box if its entire length can lie on the bottom of the box. Mirko examines the matches one by one.

### Input

The first line of input contains an integer N (1 ≤ N ≤ 50), the number of matches on the floor, and two integers W and H, the dimensions of the box (1 ≤ W ≤ 100, 1 ≤ H ≤ 100).

Each of the following N lines contains a single integer between 1 and 1000 (inclusive), the length of one match.

### Output

For each match, in the order they were given in the input, output on a separate line "DA" if the match fits in the box or "NE" if it does not.

### Sample Tests

## Input5 3 4 3 4 5 6 7 ## OutputDA DA DA NE NE |
## Input2 12 17 21 20 ## OutputNE DA |

All Submissions

Best Solutions

**Point Value:** 3

**Time Limit:** 1.00s

**Memory Limit:** 32M

**Added:** Jul 10, 2013

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

It's quiet in here...