#include <iostream>
#include <fstream>
using namespace std;
struct nod{
    int val;
    nod *next;
};
nod *prim=NULL;
void adaugare(int val)
{
    nod *p=new nod;
    p->val=val;
    p->next=prim;
    prim=p;
}
int main()
{
    ifstream f("stergeri.in");
    ofstream g("stergeri.out");
    int n,m,k,i,a,b,j;
    f>>n>>m>>k;
    for(i=n;i>=1;i--)adaugare(i);
    nod *r, *s;
    for(i=1;i<=m;i++)
    {
        f>>a>>b;
        r=prim;
        s=prim;
        j=1;
        if(a!=1){
        while(j!=a-1){if(r->next!=NULL)r=r->next; j++;}
        }
        j=1;
        if(b!=n)
        {
            while(j!=b+1){if(s->next!=NULL)s=s->next; j++;}
        }
        if(a==1)prim=s;
        else if(b==n) r->next=NULL;
        else r->next=s;
    }
    r=prim;
    j=1;
    while(j!=k && r!=NULL)
    {
        r=r->next;
        j++;
    }
    if(r!=NULL)g<<r->val;
    f.close();
    g.close();
    return 0;
}