#include <bits/stdc++.h>

using namespace std;

ifstream fin("stergeri.in");
ofstream fout("stergeri.out");

struct chtholly {
	struct node_t {
		int l, r;
		mutable int v;
		node_t() {}
		node_t(int l, int r, int v): l(l), r(r), v(v) {}
		bool operator < (const node_t &oth) const {
			return l < oth.l;
		}
	};
	int n;
	set<node_t> tree;
	chtholly() {}
	chtholly(int n): n(n) {
		tree.emplace(0, n - 1, 0);
	}
	set<node_t>::iterator split(int x) {
		auto it = tree.lower_bound(node_t(x, -1, 0));
		if(it != tree.end() && it->l == x) {
			return it;
		}
		it--;
		if(it->r < x) {
			return tree.end();
		}
		int l = it->l, r = it->r, v = it->v;
		tree.erase(it);
		tree.emplace(l, x - 1, v);
		return tree.emplace(x, r, v).first;
	}
	void flatten(int l, int r, int v) {
		auto R = split(r + 1), L = split(l);
		tree.erase(L, R);
		tree.emplace(l, r, v);
	}
	int query(int r) {
		auto R = split(r + 1), L = split(0);
		int res = 0;
		while(L != R) {
			res += L->v * (L->r - L->l + 1);
			L++;
		}
		return r + res;
	}
	void update(int l, int r) {
		l = query(l);
		r = query(r);
		flatten(l, r, 1);
	}
};

int main() {
	int n, m, k;
	fin >> n >> m >> k;
	chtholly ds(n);
	for(int i = 0; i < m; i++) {
		int l, r;
		fin >> l >> r;
		l--; r--;
		ds.update(l, r);
	}
	fout << ds.query(ds.query(k)) << '\n';
	return 0;
}