Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Race Against Time

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputHave you ever tried to explain to the coordinator, why it is eight hours to the contest and not a single problem has been prepared yet? Misha had. And this time he has a really strong excuse: he faced a space-time paradox! Space and time replaced each other.

The entire universe turned into an enormous clock face with three hands — hour, minute, and second. Time froze, and clocks now show the time *h* hours, *m* minutes, *s* seconds.

Last time Misha talked with the coordinator at *t*_{1} o'clock, so now he stands on the number *t*_{1} on the clock face. The contest should be ready by *t*_{2} o'clock. In the terms of paradox it means that Misha has to go to number *t*_{2} somehow. Note that he doesn't have to move forward only: in these circumstances time has no direction.

Clock hands are very long, and Misha cannot get round them. He also cannot step over as it leads to the collapse of space-time. That is, if hour clock points 12 and Misha stands at 11 then he cannot move to 1 along the top arc. He has to follow all the way round the clock center (of course, if there are no other hands on his way).

Given the hands' positions, *t*_{1}, and *t*_{2}, find if Misha can prepare the contest on time (or should we say on space?). That is, find if he can move from *t*_{1} to *t*_{2} by the clock face.

Input

Five integers *h*, *m*, *s*, *t*_{1}, *t*_{2} (1 ≤ *h* ≤ 12, 0 ≤ *m*, *s* ≤ 59, 1 ≤ *t*_{1}, *t*_{2} ≤ 12, *t*_{1} ≠ *t*_{2}).

Misha's position and the target time do not coincide with the position of any hand.

Output

Print "YES" (quotes for clarity), if Misha can prepare the contest on time, and "NO" otherwise.

You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").

Examples

Input

12 30 45 3 11

Output

NO

Input

12 0 1 12 1

Output

YES

Input

3 47 0 4 9

Output

YES

Note

The three examples are shown on the pictures below from left to right. The starting position of Misha is shown with green, the ending position is shown with pink. Note that the positions of the hands on the pictures are not exact, but are close to the exact and the answer is the same.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/21/2019 05:30:12 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|