Club of Brutal People#7661
Stepan is a member of a famous club known for its tough people. The club maintains a ranking of its members, which is updated only during the annual competitions.
The competition consists of consecutive rounds. In each round, the top members (according to the current ranking) gather around a table with onions. As they start cutting the onions, the first person to shed a tear is moved to the last position in the ranking, and the round ends. It is important to note that each member has a unique ranking.
During the competition, a log is kept in which, after each round, the position of the eliminated participant at the beginning of that round is recorded (after the round, they move to the last position).
Stepan has found this year's competition log, but he has forgotten his initial ranking position before the competition started. However, he remembers his current position in the ranking. Your task is to help Stepan determine his position before the competition began.
Write a program to help Stepan restore his initial position before the competition started.
\InputFileThe first line contains three integers , , (1 \leq k < n \leq 10^9, 1 \leq m \leq 10^5) — the number of club members, the number of participants in each round, and the number of rounds, respectively.
The second line contains integers: the -th number a_i (1 \leq a_i \leq k) specifies the position of the eliminated participant in the corresponding round.
The third line contains a single integer (1 \leq p \leq n) — Stepan's position after the competition.
\OutputFilePrint a single integer — Stepan's position before the competition started.
\NoteInitially, Stepan was in the third position. After the first round, the participant in the first position was moved to the last, so Stepan moved up to the second position. After the second round, Stepan was moved to the last position. After the third round, he moved up to the fifth position.
Beispiel 1