#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,k,u,v,pos=1;
cin>>n>>m>>k;
set<int>hole;
auto hh=hole.begin();
while(m--) cin>>u,hh=hole.emplace_hint(hh,u);
while(k--)
{
cin>>u>>v;
if(hole.count(pos)==1) break;
if(u==pos) pos=v;
else if(v==pos) pos=u;
}
cout<<pos;
return 0;
}
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |