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
buf = input()
n = int(buf.split()[0])
m = int(buf.split()[1])
s = int(buf.split()[2])
occupied_houses = []
for i in range(m):
    occupied_houses.append(input())

houses = []
tmp = 1
while tmp <= n:
    houses.append(tmp)
    tmp += 1
for i in range(m):
    for j in range(int(occupied_houses[i].split()[0])-1, int(occupied_houses[i].split()[1])):
        houses[j] = -1

closest_house_distance = n+1
closest_house = n+1
for i in range(n):
    if abs(s - houses[i]) < closest_house_distance and houses[i] != -1:
        closest_house_distance = abs(s - houses[i])
        closest_house = houses[i]

print(closest_house)