Lawn mower#1819
The International Collegiate Soccer Competition (ICSC) is famous for its well-maintained rectangular stadiums. The grass playing fields in ICSC stadiums are always meters long and meters wide. The grass is mowed every week with special lawn mowers, always using the same strategy: first, a series of passes is made along the length of the field, and then the same is done along the width of the field. All passes are straight lines, parallel to the sides of the field.
ICSC has hired a new mower, Guido, who is very chaotic and chooses random starting positions for each of his passes, rather than cutting the field incrementally. But he is afraid of not doing a good job and being fired by ICSC, so he has asked for your help. Write a program to ensure that the grass on the field is perfectly mowed: all parts of the field must be mowed at least once by passes from end to end and again by passes from side to side.
Each test case contains lines. The first line has two integers, n_x (0 < n_x < 1000) and n_y (0 < n_y < 1000), and a real number (0 < w \leq 50) representing the width of the mower's cut. The next line describes the end-to-end passes (along the field's length) with n_x real numbers x_i (0 \leq x_i \leq 75) giving the starting positions of the mower center in passes along the length. The last line describes the side-to-side passes, with n_y real numbers y_i (0 \leq y_i \leq 100).
The end of input is signaled by the line "0 0 0.0", for which you should not produce any output, as it is not a test case.
Real numbers for , x_i and y_i can have up to digits after the decimal point, and any cut also includes its boundaries. For example, if a -meter wide cut is made along , then grass from to (inclusive) is considered "cut".
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 going along the length of the field and again along the width.
Example 1