Changyoung angrily threw several matches onto the floor. The matches now need to be collected in a rectangular box.
The bottom of the box is a rectangle with width W and height H. A match can be put into the box only if the whole match can lie flat on the bottom of the box. For each match length, determine whether that match can fit in the box.
The first line contains the number of thrown matches N, the width W of the box, and the height H of the box. (1 <= N <= 50, 1 <= W, H <= 100)
Each of the next N lines contains one match length. Every length is an integer between 1 and 1000, inclusive.
For each match in the input order, print DA if it can fit in the box, and print NE otherwise.