Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Find The Bone

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputZane the wizard is going to perform a magic show shuffling the cups.

There are *n* cups, numbered from 1 to *n*, placed along the *x*-axis on a table that has *m* holes on it. More precisely, cup *i* is on the table at the position *x* = *i*.

The problematic bone is initially at the position *x* = 1. Zane will confuse the audience by swapping the cups *k* times, the *i*-th time of which involves the cups at the positions *x* = *u*_{i} and *x* = *v*_{i}. If the bone happens to be at the position where there is a hole at any time, it will fall into the hole onto the ground and will not be affected by future swapping operations.

Do not forget that Zane is a wizard. When he swaps the cups, he does not move them ordinarily. Instead, he teleports the cups (along with the bone, if it is inside) to the intended positions. Therefore, for example, when he swaps the cup at *x* = 4 and the one at *x* = 6, they will not be at the position *x* = 5 at any moment during the operation.

Zane’s puppy, Inzane, is in trouble. Zane is away on his vacation, and Inzane cannot find his beloved bone, as it would be too exhausting to try opening all the cups. Inzane knows that the Codeforces community has successfully helped Zane, so he wants to see if it could help him solve his problem too. Help Inzane determine the final position of the bone.

Input

The first line contains three integers *n*, *m*, and *k* (2 ≤ *n* ≤ 10^{6}, 1 ≤ *m* ≤ *n*, 1 ≤ *k* ≤ 3·10^{5}) — the number of cups, the number of holes on the table, and the number of swapping operations, respectively.

The second line contains *m* distinct integers *h*_{1}, *h*_{2}, ..., *h*_{m} (1 ≤ *h*_{i} ≤ *n*) — the positions along the *x*-axis where there is a hole on the table.

Each of the next *k* lines contains two integers *u*_{i} and *v*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*, *u*_{i} ≠ *v*_{i}) — the positions of the cups to be swapped.

Output

Print one integer — the final position along the *x*-axis of the bone.

Examples

Input

7 3 4

3 4 6

1 2

2 5

5 7

7 1

Output

1

Input

5 1 2

2

1 2

2 4

Output

2

Note

In the first sample, after the operations, the bone becomes at *x* = 2, *x* = 5, *x* = 7, and *x* = 1, respectively.

In the second sample, after the first operation, the bone becomes at *x* = 2, and falls into the hole onto the ground.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/26/2019 11:51:25 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|