Description
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?=?ui and x?=?vi. 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?≤?106, 1?≤?m?≤?n, 1?≤?k?≤?3·105) — 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 h1,?h2,?…,?hm (1?≤?hi?≤?n) — the positions along the x-axis where there is a hole on the table.

Each of the next k lines contains two integers ui and vi (1?≤?ui,?vi?≤?n, ui?≠?vi) — 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.

#include <stdio.h> #include <stdlib.h>/* run this program using the console pauser or add your own getch, system("pause") or input loop */ long n,m,k; long h[1000000]; int main(int argc, char *argv[]) {scanf("%ld%ld%ld",&n,&m,&k);long i,j;long temp;for(i=0;i<m;i++){scanf("%ld",&temp);h[temp]=1;}long temp1,temp2;long qiu=1;int flag=1;if(h[1]){flag=0;}else{for(i=1;i<=k;i++){scanf("%ld%ld",&temp1,&temp2);if((qiu==temp1||qiu==temp2)&&flag)qiu=temp1+temp2-qiu;if(h[qiu]==1)flag=0;}}printf("%ld\n",qiu);return 0; }

總結

以上是生活随笔為你收集整理的Find The Bone的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。