import java.util.*;

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

class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int X = sc.nextInt();

        int[] A = new int[M + 1];
        int[] costs = new int[]{0,0};
        for (int i = 1; i <= M; i++) {
            A[i] = sc.nextInt();
            if (A[i] < X) {
                costs[0] += 1;
            } else if (A[i] > X) {
                costs[1] += 1;
            }
        }

        System.out.println(Math.min(costs[0], costs[1]));

        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