/*
  AOJ 1600
  Title:
  @kankichi573
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int m,nmin,nmax;

int compare_int(const void *a, const void *b)
{
  if( *(int *)a > *(int *)b)
    return(-1);
  if( *(int *)a < *(int *)b)
    return(1);
  if( *(int *)a == *(int *)b)
    return(0);
}



main()
{
  int i,max_,max_p,diff,P[200];
  
  while(scanf("%d %d %d",&m,&nmin,&nmax)  && (m||nmin||nmax))
    {
      memset(P,0,sizeof(P));
      for(i=0;i<m;i++)
	scanf("%d",&P[i]);
      qsort(P,m,sizeof(int),compare_int);
      max_=0;
      for(i=nmin ;i<=nmax;i++)
	{
	  diff=P[i-1]-P[i];
	  //printf("diff=%d\n",diff);
	if(max_ <= diff)
	  {
	    max_  = diff;
	    max_p = i;
	  }
	}
      printf("%d\n",max_p);
      //printf("[%d]\n",max_);
    }
  return(0);
}