1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include <bits/stdc++.h>
#include <cstdlib>
#define nl '\n'

using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

int main()
{
	cin.tie(0)->sync_with_stdio(0);
	ll n, m, s;
	cin>>n>>m>>s;
	vector<pll> seg(m);
	for(auto &[a, b]: seg){
		cin>>a>>b;
	}
	sort(seg.begin(), seg.end());
	deque<pll> segs; //uoh
	for(auto [a, b]: seg){
		if(!segs.size() || segs.back().second != a-1){ segs.push_back({a, b}); continue; }
		segs.back().second = b;
	}
	/*for(auto [a, b]:segs){
		cerr<<a<<' '<<b<<nl;
	}*/
	while(!(segs.front().first <= s && s <= segs.front().second)){ segs.pop_front(); }
	while(!(segs.back().first <= s && s <= segs.back().second)){ segs.pop_back(); }
	ll res = (abs(segs[0].second - s) < abs(segs[0].first - s) && segs[0].second != n ) || segs[0].first == 1 ? segs[0].second + 1 : segs[0].first - 1;
	cout<<res<<nl;
	return 0;
}