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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2")

#define LL long long
#define int long long

int32_t main() {

    int n,m,s;
    cin>>n>>m>>s;
    vector<pair<int,int>> tab;
    for(int i=0;i<m;i++){
        int l,r;
        cin>>l>>r;
        tab.push_back({l,r});
    }

    sort(tab.begin(), tab.end());


    vector<pair<int,int>> tab2;
    pair<int, int> prev = tab[0];
    for(int i=1;i<m;i++){
        pair<int,int> curr = tab[i];

        if(curr.first == prev.second +1){
            prev.second = curr.second;
        }
        else{
            tab2.push_back(prev);
            prev = curr;
        }
    }
    tab2.push_back(prev);

    for(pair<int,int> curr: tab2){
        if(curr.first <=s && curr.second >=s){
            int l = curr.first-1;
            int r = curr.second+1;

            int l_dist = s-l;
            int r_dist = r-s;

            if(l <= 0) l_dist = 1ll<<42;
            if(r > n) r_dist = 1ll<<42;

            if(l_dist <= r_dist) cout<<l<<endl;
            else cout<<r<<endl;
            break;
        }
    }

    return 0;
}