import java.util.Scanner;

public class Main {
	public static void main(String... args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int x = sc.nextInt();
int f=-1;
long a[]=new long[m+1];
a[0]=-3;
for(int i=1;i<=m;i++){
	a[i]=sc.nextLong();
if(a[i-1]<x&&a[i]>x){
	f=i;
}
}

System.out.println(Math.min(f-1, m-f+1));

	}}
/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