#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int N,X,P; cin >> N >> X >> P; vector<int> A(N); for(int i = 0; i < N; i++){ cin >> A[i]; } A.push_back(X); A.push_back(P); sort(A.begin(),A.end()); for(int i = 0; i < A.size(); i++){ if(A[i] == P){ cout << i+1 << endl; return 0; } } }

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int P = sc.nextInt();

        int[] A = new int[N];
        for(int i = 0; i < N; i++){
            A[i] = sc.nextInt();
        }
        A[N] = X;
        A[N+1] = P;

        Arrays.sort(A);

        for(int i = 0; i < A.length; i++){
            if(A[i] == P){
                System.out.println(i+1);
                break;
            }
        }
    }
}