#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

vector <long int> x, y;
vector <long int> :: reverse_iterator rit;
long int n, m, k, i;
long int poz, nr1, nr2;

int main ()
{
	FILE *f = fopen ("stergeri.in","r");
	FILE *g = fopen ("stergeri.out","w");
	fscanf (f,"%ld %ld %ld", &n, &m, &k);
	
	for (i=1; i<=m; ++i)
	{
		fscanf (f,"%ld %ld", &nr1, &nr2);
		x.push_back (nr1);
		y.push_back (nr2);
	}
	poz = k;
	
	i = m - 1;
	for (rit = x.rbegin(); rit < x.rend(); ++rit)
	{
		if (min (*rit, poz) == *rit)
			poz += (y[i] - *rit + 1);
		i --;
	}
	
	fprintf (g,"%ld", poz);
	
	fclose(g);
	fclose(f);
	return 0;
}