import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solveB();
	}

	private void solveB() {
		int min = 0;
		int max = 0;

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		int X = sc.nextInt();
		int A[] = new int[M];
		for (int i = 0; i < M; i++) {
			A[i] = sc.nextInt();
		}



		for (int j = 0; j <= M - 1; j++) {
			if (X > A[j]) {
				min = min + 1;
			}
		}
		for (int k = M - 1; k >= 0; k--) {
			if (X < A[k]) {
				max = max + 1;
			}
		}

		if (min > max) {
			System.out.println(max);
		} else if (min < max) {
			System.out.println(min);
		} else {
			System.out.println(min);
		}

		return;
	}

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz