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 =list(map(int,input().split()))
min(sum(a>X for a in A),sum(a<X for a in A))
N,M,X =(map(int,input().split()))
A =list(map(int,input().split()))
print(min(sum(a>X for a in A),sum(a<X for a in A)))