Find the House

Younghee is on a one-dimensional road and is looking for her friend Jisun's house. To learn the exact position of Jisun's house, Younghee sends Jisun a message with her current position (assume that all positions are represented as integers). A couple of minutes later, Younghee receives a reply: a list of $n$ triples from Jisun, with the following explanation attached.

• For each triple $(i, j, k)$ in the list, $i$ is an integer that denotes the current position, $j$ denotes the direction to move from $i$ and is either $L$ (left) or $R$ (right), and $k$ is a positive integer that denotes the distance to move from $i$.
• For any two triples $(i, j, k)$ and $(i', j', k')$ in the list, $i$ and $i'$ are distinct.
• If you are currently at position $i$, a triple $(i, j, k)$ always exists in the list (unless every triple in the list has already been referred to). In this case, refer to the triple $(i, j, k)$ and move to $i - k$ (if $j = \texttt{L}$) or $i + k$ (if $j = \texttt{R}$).
• Each triple in the list is referred to exactly once.
• The position after referring to all the triples in the list is the position of Jisun's house.

For example, suppose Younghee is currently at position 0 with a list of four triples: $(3, \texttt{R}, 4)$, $(0, \texttt{L}, 2)$, $(7, \texttt{L}, 5)$, and $(-2, \texttt{R}, 5)$. Then Younghee first refers to the triple $(0, \texttt{L}, 2)$ and moves to position $0 - 2 = -2$. After that, Younghee refers to the triples $(-2, \texttt{R}, 5)$, $(3, \texttt{R}, 4)$, and $(7, \texttt{L}, 5)$ in order and moves to position $2$, which is the position of Jisun's house. Given $n$, Younghee's current position, and a list of $n$ triples, write a program to find the position of Jisun's house.

Your program reads from standard input. The input starts with a line containing an integer $n$ ($1 ≤ n ≤ 10,000$), where $n$ is the number of triples in the list. In the following $n$ lines, $n$ triples are given, where each triple is represented as three values $i$, $j$, and $k$: two integers $i$ and $j$ and one character $k$ ($-1,000,000 ≤ i ≤ 1,000,000$, $j \in \{\texttt{L}, \texttt{R}\}$, and $1 ≤ k ≤ 2,000,000$). After the $n$ lines of triples, there is a line containing Younghee's current position as an integer between $-1,000,000$ and $1,000,000$.

Your program writes to standard output. Print exactly one line. The line contains the position of Jisun's house.