Problem Statement

You are given a prime $P$, $N$ non-negative integers $A_i(1 \le i \le N)$, and a string $S$ consisting of $N - 1$ characters, each of which is one of ```+```, ```-```, ```*```, ```/```.
Letting $operator_j$ be the $j(1 \le j \le N - 1)$-th character of $S$, compute and output the following value.
$(( \dots ((A_1\ operator_1\ A_2)\ operator_2\ A_3)\ operator_3 \dots \ A_{N-1})\ operator_{N-1}\ A_N)$ over $\mod P$
In other words, perform the calculation in order from the front, regardless of the operators.
Here, the division p/q over $\mod P$ is defined to have as its result the unique integer $r$ such that $p \equiv qr (\mod P)$ and $0 \le r < P$.

Input

$P\ N$
$A_1\ A_2\ \dots\ A_N$
$S$

$2 \le P \le 10^9$
$2 \le N \le 10^5$
$P$ is prime
$1 \le A_i < P$
$|S| = N - 1$
$S$ consists only of +, -, *, /

Output

Output the answer on one line. End the output with a newline.

Sample

11 10
1 5 5 2 3 4 6 5 2 8
++*--//*-

4