Ari's Clever Portal Trip

To hunt the boss monster, Ari has to take the portal in the wilderness. However, the wilderness also holds one minion monster, the right arm of the boss monster, which tries to stop Ari from reaching the portal. The wilderness is an $N \times M$ grid with $N$ rows and $M$ columns. The top left cell is $(1, 1)$ and the bottom right cell is $(N, M)$. Ari starts at $(1, Ac)$, the minion monster is at $(Sr, Sc)$, and the portal is at $(N, M)$. The minion monster is never located at $(N, M)$.

The minion monster cannot move from its starting cell, so it cannot block Ari directly. Instead, it casts a spell on Ari's movement:

• Ari moves either left or right.
• If Ari is moving left, Ari must go to the left end of the row. If Ari is moving right, Ari must go to the right end of the row. When Ari reaches the end of a row, Ari moves down one row.
• When Ari moves down, the direction becomes the opposite of the direction in the row above.

For example, when the grid has 5 rows and 6 columns and Ari starts at $(1, 3)$, Ari's paths for each direction are shown below.

Ari moving left	Ari moving right

Under these restrictions, Ari may meet the minion monster, or may go straight to the portal without meeting it. Before Ari leaves, check whether Ari meets the minion monster.

The first line contains two integers $N$ and $M$, the size of the wilderness. ($2 \le N, M \le 100$)

The second line contains an integer $Ac$ ($1 \le Ac \le M$), the column where Ari starts, and Ari's direction $D$. $D$ is either 0 or 1. If $D$ is 0, Ari moves left. If $D$ is 1, Ari moves right.

The third line contains two integers $Sr$ ($2 \le Sr \le N$) and $Sc$ ($1 \le Sc \le M$), the position of the minion monster.

If Ari can reach the portal without meeting the minion monster, print "YES!" on the first line. If Ari meets the minion monster, print "NO...".