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 triples from Jisun with an additional explanation as follows:
For each triple in the list, is an integer which denotes the current position, denotes the direction to move from , represented as (left) or (right), and is a positive integer which denotes the distance to move from .
For any two triples and in the list, and are distinct.
If you are currently on the position , there always exists a triple in the list (unless all the triples in the list are referred before). In this case, refer to the triple and move to (if ) or (if ).
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 with a list of four triples -- , , , and . Then Younghee first refers to the triple and move to the position . After that, Younghee refers to the triples , , and in order and moves to the position , which is the position of Jisun's house. Given , Younghee's current position, and a list of 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 (), where is the number of triples in the list. In the following lines, triples are given where each triple is represented as three values , , and , consisting of two integers and and one character (, , and ). After lines of triples, there is a line containing Younghee's current position as an integer between and .
输出格式
Your program is to write to standard output. Print exactly one line. The line should contain the position of Jisun's house.
