【CodeForces 796B】Find The Bone



B. Find The Bone

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Zane 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⁶, 1 ≤ m ≤ n, 1 ≤ k ≤ 3·10⁵) — 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₁, h₂, ..., 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 43 4 61 22 55 77 1

output

1

input

5 1 221 22 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.

题目大意：1号杯子里有骨头，执行k次交换操作，若杯子底部有洞则掉入，问骨头最终位置

思路：模拟，1号杯子也可能有洞，又被坑了，果然，还是要好好读题‘

#include <bits/stdc++.h>#define manx 1000006using namespace std;int main(){    int n,m,k,x,y;    bool a[manx];    while(~scanf("%d%d%d",&n,&m,&k)){        memset(a,true,sizeof(a));        for (int i=0; i<m; i++){            scanf("%d",&x);            a[x]=false;        }        int pos=1;        bool f;        if (a[1]) f=true;        else f=false;        for (int i=0; i<k; i++){            scanf("%d%d",&x,&y);            if (f){                if (x==pos){                    pos=y;                    if (!a[y]) f=false;                }                else if (y==pos){                    pos=x;                    if (!a[x]) f=false;                }            }        }        printf("%d\n",pos);    }    return 0;}