//package java_prgms;
import java.util.*;
public class cb_1 {

	public static void main(String[] args) {
		int n,x,y,i,flag=0,c=0,c1=0,k=0,days;
		Scanner ob=new Scanner(System.in);
		n=ob.nextInt();
		x=ob.nextInt();
		y=ob.nextInt();
		int a[]=new int[n];
		a[0]=ob.nextInt();
		if(n==1)
		{
			System.out.println(1);
		}
		else
		{
		for(i=1;i<n;i++)
		{
			a[i]=ob.nextInt();
			if(a[i]<a[i-1])
			{
				a[i-1]=1;
			}
			else
				a[i-1]=0;
		}
		if(a[i-1]<a[i-2])
		{
			a[i-1]=1;
		}
		else
			a[i-1]=0;
		int b[]=new int[n];
		k=0;
		for(i=0;i<n;i++)
		{
			if(a[i]==1)
			{
				if(flag==0)
					c++;
				else
				{
					b[k]=c1;
					k++;
					c1=0;
					c++;
					flag=0;
				}
			}
			if(a[i]==0)
			{
				if(flag==1)
					c1++;
				else
				{
					b[k]=c;
					k++;
					c=0;
					c1++;
					flag=1;
				}
			}
		}
		if(a[i-1]==1)
		{
			if(flag==0)
			{
				b[k]=c;
				k++;
				b[k]=0;
				k++;
			}
			else
			{
				b[k]=1;
				k++;
				b[k+1]=0;
				k++;
			}
		}
		if(a[i-1]==0)
		{
			if(flag==1)
			{
				b[k]=c1;
				k++;
			}
			else
			{
				b[k]=1;
				k++;
			}
		}
		/*for(i=0;i<k;i++)
			System.out.print(b[i]+" ");
		System.out.println();*/
		if(k==2)
			System.out.println(b[0]+1);
		else if(b[1]>=y)
			System.out.println(b[0]+1);
		else if(b[k-2]>=x)
			System.out.println(n-b[k-1]+1);
		else
		{
			days=b[0];
			
		for(i=1;i<k;i=i+2)
		{
			if(b[i]>=y&&b[i-1]>=x)
			{
				System.out.println(days+1+b[i]);
				break;
			}
			days+=b[i];
			
		}
		}
		}
	}

}
