Input

$x$ $y$ $z$
$S_0$ $t_0$
$S_1$ $t_1$

Input Format

$x$, $y$, $z$ are the numbers of stations on lines A, B, and C, respectively.
$x$, $y$, $z$ are positive integers. $1 \le x,y,z \le 1000000000 = 10^9$.
$S_0$ is the line name of the starting station, and $t_0$ is the station number of the starting station.
$S_1$ is the line name of the destination station, and $t_1$ is the station number of the destination station.
$S_i$ is one of the letters 'A', 'B', 'C'.
$t_i$ is a positive integer.
If $S_i$ is 'A', then $1 \le t_i \le x$.
If $S_i$ is 'B', then $1 \le t_i \le y$.
If $S_i$ is 'C', then $1 \le t_i \le z$.
The starting station and the destination station are never the same.

Output

Output the required fare on one line. Print a newline at the end.

Sample