There are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.  Initially, you are in Square X. You can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N. However, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1. It is guaranteed that there is no toll gate in Square 0, Square X and Square N.  Find the minimum cost incurred before reaching the goal.
n,m,x = map(int,input().split())
a = [int(i) for i in input().split()]

ans =0
for i in range(x+1,n+1):
  if x+1 in a:
    ans +=1
  
  
print(ans)
n,m,x = map(int,input().split())
a = [int(i) for i in input().split()]

ans1 = 0
ans2 = 0

for i in range(x+1,n+1):
  if i in a:
    ans1 += 1

for j in range(x):
  if j in a:
    ans2 += 1
    
ans = min(ans1,ans2)
  
  
print(ans)