Find the House

문제

Younghee is currently on a one-dimensional road and looking for her friend Jisun’s house. To know the exact position of Jisun’s house, Younghee sends a message to Jisun with her current position (assume that all the positions are represented as integers). A couple of minutes later, Younghee gets a reply as a list of $nn$ triples from Jisun with an additional explanation as follows:

• For each triple $(i,j,k)(i,\; j,\; k)$ in the list, $ii$ is an integer which denotes the current position, $jj$ denotes the direction to move from $ii$, represented as $LL$ (left) or $RR$ (right), and $kk$ is a positive integer which denotes the distance to move from $ii$.
• For any two triples $(i,j,k)(i,\; j,\; k)$ and $(i^{\mathrm{\prime }},j^{\mathrm{\prime }},k^{\mathrm{\prime }})(i\text{'},\; j\text{'},\; k\text{'})$ in the list, $ii$ and $i^{\mathrm{\prime }}i\text{'}$ are distinct.
• If you are currently on the position $ii$, there always exists a triple $(i,j,k)(i,\; j,\; k)$ in the list (unless all the triples in the list are referred before). In this case, refer to the triple $(i,j,k)(i,\; j,\; k)$ and move to $i-ki\; -\; k$ (if $j=\mathtt{\text{L}}j\; =\; \backslash texttt\{L\}$) or $i+ki\; +\; k$ (if $j=\mathtt{\text{R}}j\; =\; \backslash texttt\{R\}$).
• Each of the triples in the list is referred exactly once.
• The position after referring to all the triples in the list is a position of Jisun’s house.

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

입력

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

출력

Your program is to write to standard output. Print exactly one line. The line should contain the position of Jisun’s house.