The International Collegiate Soccer
Competition (ICSC) is famous for its wellkept rectangular
stadiums. The grass playing fields in ICSC stadiums are always
100 meters long, and 75 meters wide. The grass is mowed every
week with special lawn mowers, always using the same strategy:
first, they make a series of passes along the length of the
field, and then they do the same along the width of the field.
All passes are straight lines, parallel to the sides of the
field.
The ICSC has hired a new lawnmower, Guido. Guido is very
chaotic, and instead of covering the field incrementally, he
likes to choose random starting positions for each of his
passes. But he is afraid of not doing a good job and being
fired by the ICSC, so he has asked you to help him. Write a
program to make sure that the grass in the field is perfectly
cut: all parts of the field have to be mowed at least once when
the mower goes from end to end, and again when the mower goes
from side to side.
Input
The input consists of at most $50$ test cases. Each test case
contains 3 lines. The first line contains two integers,
$n_ x$ ($0 < n_ x < 1\, 000$) and
$n_ y$ ($0 < n_ x < 1\, 000$), and a
real number $w$
($0 < w \leq 50$),
which represents the width of the cut of that particular lawn
mower. The next line describes the endtoend passes (along the
length of the field), and contains $n_ x$ real numbers $x_ i$ ($0 \leq x_ i \leq 75$) describing the
starting positions of the mower’s center in Guido’s endtoend
passes. The last line describes the sidetoside passes, with
$n_ y$ real numbers
$y_ i$ ($0 \leq y_ i \leq 100$).
The end of the test cases is signalled with a line that
contains the numbers 0 0 0.0. You
should generate no output for this line, as it is not a test
case.
Real numbers for $w$,
$x_ i$ and $y_ i$ can have up to 7 digits after
the decimal point, and any cut will also include its
boundaries. For example, if a $2.0$meter wide cut is performed
along the $10.0$meter
mark, then a strip of grass from $9.0$ to $11.0$ (including both) will be
considered “cut”.
Output
Print YES if Guido has done a good
job, or NO if some part of the field
has not been mowed at least once when the mower was travelling
along the length of the field, and again when it was travelling
along the width.
Sample Input 1 
Sample Output 1 
8 11 10.0
0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0
0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0 80.0 90.0 100.0
8 10 10.0
0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0
0.0 10.0 30.0 40.0 50.0 60.0 70.0 80.0 90.0 100.0
4 5 20.0
70.0 10.0 30.0 50.0
30.0 10.0 90.0 50.0 70.0
4 5 20.0
60.0 10.0 30.0 50.0
30.0 10.0 90.0 50.0 70.0
0 0 0.0

YES
NO
YES
NO
