#include <cstdio>
#include <cstring>
#include <algorithm>
#define MaxN 100005

using namespace std;

FILE *IN,*OUT;
int N,K,M;
struct _Int
{
    int Start,End;
}Q[MaxN];
int main()
{
    IN=fopen("stergeri.in","r");
    OUT=fopen("stergeri.out","w");

    fscanf(IN,"%d%d%d",&N,&M,&K);
    for(int i=1;i<=M;i++)
    {
        fscanf(IN,"%d%d",&Q[i].Start,&Q[i].End);
    }
    for(int i=M;i>0;i--)
    {
        if(K>=Q[i].Start)
            K+=Q[i].End-Q[i].Start+1;
    }
    fprintf(OUT,"%d",K);
    return 0;
}