On a board of size KxN cells (K rows, N columns), there is a chess knight in the j-th row and i-th column. Can he get into the cell in the m-th row and s-th column in one or more moves?
Input
6 natural numbers are entered: K, N, j, i, m, s (1 ≤ K ≤ N ≤ 100). Cells (i, j) and (s, m) do not match.
Imprint
Print the word YES if it is possible, and NO otherwise.
Examples
| # |
Input |
Output |
| 1 |
8 8 1 2 7 8 |
YES |