output_description: For each dataset, output the number of successful applicants in a line.
input_description: The input consists of multiple datasets. Each dataset is formatted as follows.
  
  > _m_ _n_ min _n_ max  
  >  _P_ 1  
  >  _P_ 2  
  >  ...  
  >  _P m_  
  >
  
  The first line of a dataset contains three integers separated by single
  spaces. _m_ represents the number of applicants, _n_ min represents the
  minimum number of successful applicants, and _n_ max represents the maximum
  number of successful applicants. Each of the following _m_ lines contains an
  integer _P i_, which represents the score of each applicant. The scores are
  listed in descending order. These numbers satisfy 0 < _n_ min < _n_ max < _m_
  ≤ 200, 0 ≤ _P i_ ≤ 10000 (1 ≤ _i_ ≤ _m_) and _P_ _n_ min > _P_ _n_ max+1.
  These ensure that there always exists an _n_ satisfying the conditions.
  
  The end of the input is represented by a line containing three zeros separated
  by single spaces.
attempt: while True:
      m, nmin, nmax = map(int, input().split())
      if m + nmin + nmax == 0:
          break
      P = [int(input()) for i in range(m)]
      gap = 0
      for i in range(nmin, nmax + 1):
          if gap <= P[i - 1] - P[i]:
              gap = P[i - 1] - P[i]
              n = i
      print(n)
  
problem_description: Entrance Examination
  
  The International Competitive Programming College (ICPC) is famous for its
  research on competitive programming. Applicants to the college are required to
  take its entrance examination.
  
  The successful applicants of the examination are chosen as follows.
  
    * The score of any successful applicant is higher than that of any unsuccessful applicant.
    * The number of successful applicants _n_ must be between _n_ min and _n_ max, inclusive. We choose _n_ within the specified range that maximizes the _gap._ Here, the _gap_ means the difference between the lowest score of successful applicants and the highest score of unsuccessful applicants. 
    * When two or more candidates for _n_ make exactly the same _gap,_ use the greatest _n_ among them.
  
  Let's see the first couple of examples given in Sample Input below. In the
  first example, _n_ min and _n_ max are two and four, respectively, and there
  are five applicants whose scores are 100, 90, 82, 70, and 65. For _n_ of two,
  three and four, the gaps will be 8, 12, and 5, respectively. We must choose
  three as _n_ , because it maximizes the gap.
  
  In the second example, _n_ min and _n_ max are two and four, respectively, and
  there are five applicants whose scores are 100, 90, 80, 75, and 65. For _n_ of
  two, three and four, the gap will be 10, 5, and 10, respectively. Both two and
  four maximize the gap, and we must choose the greatest number, four.
  
  You are requested to write a program that computes the number of successful
  applicants that satisfies the conditions.
samples: [{"input": "2 4\n    100\n    90\n    82\n    70\n    65\n    5 2 4\n    100\n    90\n    80\n    75\n    65\n    3 1 2\n    5000\n    4000\n    3000\n    4 2 3\n    10000\n    10000\n    8000\n    8000\n    4 2 3\n    10000\n    10000\n    10000\n    8000\n    5 2 3\n    100\n    80\n    68\n    60\n    45\n    0 0 0", "output": "4\n    2\n    2\n    3\n    2"}]