Shuttlecock

Time Limit: 1 Second    Memory Limit: 32768 KB

Shuttlecock is an interesting sport. The sport requires six players to participate in at a time, who are equally parted into two teams. The region they play in is rectangular and it is equally divided by a net in the center that is parallel to one side line. One team wins a point if the other side cannot catch the shuttlecock that fall on their region (actually you can just comfortably regard it as volleyball with 3 player in each side).

skatou is a fan of the sport. With carefully observation, he finds that each player has a region that he is reachable at a time, you can surely win if you kick the shuttlecock in a place that is out of the reach of all the three players in the other side. "How wonderful if I can find out such weak points", he thought. Now is your job to help skatou to determine whether there are places which are out of the reach of the players in the other side. Assume the region that is reachable for a player is a circle, with himself in the center and a radius of r.

Input

There are multiple test cases, each consist of 5 lines. The first three lines are the description of the regions of the three players in the other side, each consist of three real numbers x, y and r (> 0), where (x, y) is coordinate of the center and r is the radius. The last two lines give you the coordinates of the up-left point and the bottom-right point of the opponent region. (NOTE: just half the region).

There is a blank line between each pair of consecutive cases. The absolute value of all the numbers are not greater than 200.

Output

If the place described above exist, output "Yes" (without quotation) otherwise output "No" (without quotation), in a separated line.

Sample Input

-5.0 0 1.0
0 0 2.0
5.0 0 1.0
-1 1
1 -1

Sample Output

No

Submit

Source: ZOJ Monthly, January 2005