p00963 Rendezvous on a Tetrahedron
Problem G Rendezvous on a Tetrahedron

One day, you found two worms $P$ and $Q$ crawling on the surface of a regular tetrahedron with four vertices $A$, $B$, $C$ and $D$. Both worms started from the vertex $A$, went straight ahead, and stopped crawling after a while.

When a worm reached one of the edges of the tetrahedron, it moved on to the adjacent face and kept going without changing the angle to the crossed edge (Figure G.1).

Write a program which tells whether or not $P$ and $Q$ were on the same face of the tetrahedron when they stopped crawling.

You may assume that each of the worms is a point without length, area, or volume.

<image>

Figure G.1. Crossing an edge

Incidentally, lengths of the two trails the worms left on the tetrahedron were exact integral multiples of the unit length. Here, the unit length is the edge length of the tetrahedron. Each trail is more than 0:001 unit distant from any vertices, except for its start point and its neighborhood. This means that worms have crossed at least one edge. Both worms stopped at positions more than 0:001 unit distant from any of the edges.

The initial crawling direction of a worm is specified by two items: the edge $XY$ which is the first edge the worm encountered after its start, and the angle $d$ between the edge $AX$ and the direction of the worm, in degrees.

<image>

Figure G.2. Trails of the worms corresponding to Sample Input 1

Figure G.2 shows the case of Sample Input 1. In this case, $P$ went over the edge $CD$ and stopped on the face opposite to the vertex $A$, while $Q$ went over the edge $DB$ and also stopped on the same face.

Input

The input consists of a single test case, formatted as follows.


$X_PY_P$ $d_P$ $l_P$
$X_QY_Q$ $d_Q$ $l_Q$


$X_WY_W$ ($W = P,Q$) is the first edge the worm $W$ crossed after its start. $X_WY_W$ is one of BC, CD or DB.

An integer $d_W$ ($1 \leq d_W \leq 59$) is the angle in degrees between edge $AX_W$ and the initial direction of the worm $W$ on the face $\triangle AX_WY_W$.

An integer $l_W$ ($1 \leq l_W \leq 20$) is the length of the trail of worm $W$ left on the surface, in unit lengths.

Output

Output YES when and only when the two worms stopped on the same face of the tetrahedron. Otherwise, output NO.

Sample Input 1


CD 30 1
DB 30 1


Sample Output 1


YES


Sample Input 2


BC 1 1
DB 59 1


Sample Output 2


YES


Sample Input 3


BC 29 20
BC 32 20


Sample Output 3


NO






Example

Input

CD 30 1
DB 30 1


Output

YES
```python
from math import cos, sin, pi, sqrt
B = ["BC", "CD", "DB"]
XY0, d0, l0, XY1, d1, l1 = open(0).read().split()
d0, l0, d1, l1 = map(int, [d0, l0, d1, l1])

def calc(XY, d, l):
    angle = B.index(XY) * 60 + d
    x = l * cos(pi*angle/180)
    y = l * sin(pi*angle/180)
    x = x + y/sqrt(3)
    y = y * 2/sqrt(3)
    x = x%2; y = y%2
    A = [["AC", "BD"], ["DB", "CA"]][int(x)][int(y)]
    return A[x%1>y%1]
print("YES"*(calc(XY0, d0, l0)==calc(XY1, d1, l1))or"NO")
```