#include<fstream>
using namespace std;
struct nod
{
       int val;
       nod *urm;};
nod *prim,*q,*ultim,*p;
int n,m,k,x,y;
void init()
{q=new nod;p=new nod;prim=new nod;prim->val=1;p->val=2;prim->urm=p;p->urm=NULL;
     for(int i=3;i<=n;i++)
  {q->val=i;q->urm=NULL;p->urm=q;
  p=q;}
     }
void cauta(int x,int y)
{
     int contor=2;
q=prim;
while(contor<=x) {contor++;q=q->urm;}
p=prim;
contor=2;
while(contor<=y) {contor++;p=p->urm;}
q->urm=p;
     }   
     
int cautaelem(int k)
{int contor=2;q=new nod; q=prim;
while(contor<=k) {contor++;q=q->urm;}
return q->val;
    }   
int main()
{ifstream in("stergeri.in");
ofstream out("stergeri.out");
in>>n>>m>>k;
init();
for(;m;m--)
 {in>>x>>y;cauta(x,y);}
out<<cautaelem(k); 
    
    return 0;}