A Certain Pumpkin's Halloween Trip

Most people don't know it, but on a star not too far from Earth live intelligent pumpkins. The pumpkins of this star are very clever and love to travel. During the Halloween holidays, the most popular trip from this star is a visit to Earth.

Pumpkins are intelligent, but they cannot move on their own. So during the holidays each pumpkin must find a person to help it. The process goes as follows.

First, the pumpkin picks a person and, through a special biological manipulation, has that person decorated to look like the pumpkin itself. Usually this means carving various holes into the body and lighting a candle inside.

In fact, Halloween is a festival enjoyed by the pumpkins of the pumpkin star. Once you realize that more than half of the screams echoing through the streets on Halloween night come from pumpkin aliens, it isn't much of a twist.

To perform this biological manipulation, a special transmission device is required. The device is made of two gold rings, and for some unknown reason these two rings must be cut from one and the same gold plate. A ring's size reflects the pumpkin's characteristics, so it differs from pumpkin to pumpkin. Therefore, before making their first trip to Earth, pumpkins must first make their own rings.

Jinuk, an alien from the pumpkin star, saved up a lot of money working part-time at a convenience store over the break, and is about to travel to Earth for the first time in his life. Having bought a gold plate to make his rings, Jinuk wants to know whether he can cut two rings that fit him exactly from this plate. If he cannot, he will have to go back to the convenience store to buy a new plate, and he will never be able to graduate.

Each ring is a circular ring (a donut shape with a hole in the middle) described by an outer radius and an inner radius, and the gold plate is a disk of a given radius. The two rings must be cut so that they do not overlap each other and both lie completely inside the plate.

The first line contains five space-separated integers A, a, B, b, P. (0 < A, a, B, b, P ≤ 1 000 000, a < A, b < B)

A and B are the outer radii of the two rings, a and b are their inner radii, and P is the radius of the plate. (See the hint figure below.)

Print "Yes" if Jinuk can make two rings satisfying the conditions, and "No" otherwise.