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
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define ll long long
#define dbg(x) cerr << #x << ": " << x << "\n"
#define mp make_pair

using namespace std;

const int M = 1005;
pair<ll, ll> input[M];

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

    ll n, s;
    int m;
    cin >> n >> m >> s;

    for (int i = 1; i <= m; i++)
    {
        cin >> input[i].f;
        cin >> input[i].s;
    }

    sort(input + 1, input + m + 1);

    ll r = s + 1;
    for (int i = 1; i <= m; i++)
    {
        if (r >= input[i].f && r <= input[i].s)
        {
            r = input[i].s + 1;
        }
    }

    ll l = s - 1;

    for (int i = m; i >= 1; i--)
    {
        if (l >= input[i].f && l <= input[i].s)
        {
            l = input[i].f - 1;
        }
    }

    if (l < 1)
    {
        cout << r;
        return 0;
    }
    if (r > n)
    {
        cout << l;
        return 0;
    }

    if (s - l <= r - s)
        cout << l;
    else
        cout << r;

    return 0;
}