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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
#define f first
#define s second
const int N = 1e3 + 5;

ll m;
int n;
pll w[N];
ll s;
vector<pll> vec;

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> m >> n >> s;

    for(int i=0;i<n;i++){
        cin >> w[i].f >> w[i].s;
    }

    sort(w,w+n);

    for(int i=0;i<n;i++){
        if(i == 0){
            vec.push_back(w[i]);
        }

        else{
            if(vec.back().s == w[i].f-1){
                vec.back().s = w[i].s;
            }
            else{
                vec.push_back(w[i]);
            }
        }
    }

    for(auto p : vec){
        if(p.f <= s && s <= p.s){
            ll a = p.f-1;
            ll b = p.s+1;
            if(b == m+1) cout << a << "\n";
            else if(a == 0) cout << b << "\n";
            else if(abs(a-s) <= abs(b-s)) cout << a << "\n";
            else cout << b << "\n";
            return 0;
        }
    }

    cout << s << "\n";
    
    return 0;
}