f(A + B)

The set of digits $\text{digit}$ is $\{0, 1, 2, \dots, 9\}$. The function $f$ has domain $\text{digit}$ and range $\text{digit}$, and it is a one-to-one correspondence. Although $f$ is defined on single digits, for convenience, a positive integer $X = \overline{x_1x_2x_3 \dots x_N}$ with $N$ digits is mapped by $f(X) = \overline{f(x_1)f(x_2)f(x_3) \dots f(x_N)}$. For example, when $f(0)=6$, $f(1)=5$, $f(3)=0$, and $f(4)=1$, then $f(1340)=5016$.

Given $f$ and the positive integers $f(A)$ and $f(B)$, write a program that computes $f(A+B)$. The positive integers $A$, $B$, $A+B$, $f(A)$, $f(B)$, and $f(A+B)$ are never given as numbers that start with 0.

The first line contains $f(0)$ through $f(9)$, separated by spaces. The second line contains $f(A)$ and $f(B)$, separated by a space.

Print $f(A+B)$ on the first line.

$1 \le a, b \le 10^7$