Entrance Examination

The International Competitive Programming College (ICPC) is known for its research on competitive programming. Every applicant to the college takes an entrance examination.

The college chooses the successful applicants by these rules.

• The score of every successful applicant is higher than the score of every unsuccessful applicant.
• The number of successful applicants $n$ is at least $n_{min}$ and at most $n_{max}$. Within that range, pick the $n$ that maximizes the gap. The gap is the lowest score among the successful applicants minus the highest score among the unsuccessful applicants.
• When two or more values of $n$ give the same gap, pick the greatest one.

For example, let $n_{min}$ be 2, let $n_{max}$ be 4, and let the five scores be 100, 90, 82, 70, 65. For $n$ equal to 2, 3, 4 the gaps are 8, 12, 5. The gap is largest at $n$ equal to 3, so the answer is 3. With the same $n_{min}$ and $n_{max}$ and the scores 100, 90, 80, 75, 65, the gaps are 10, 5, 10. Both 2 and 4 reach the maximum, so pick the greater one, 4.

Given the scores of the applicants, write a program that computes the number of successful applicants.

The input consists of several datasets. Each dataset has this format.

m nmin nmax
P1
P2
...
Pm

The first line holds three integers separated by single spaces. $m$ is the number of applicants, $n_{min}$ is the minimum number of successful applicants, and $n_{max}$ is the maximum number of successful applicants. Each of the next $m$ lines holds one score $P_i$. The scores are given in descending order, and the same score may appear more than once.

The input satisfies $0 < n_{min} < n_{max} < m \le 200$, $0 \le P_i \le 10000$ ($1 \le i \le m$), and $P_{n_{min}} > P_{n_{max}+1}$. An $n$ satisfying the rules therefore always exists.

A line holding three zeros separated by single spaces marks the end of the input. Do not process that line.

For each dataset, print the number of successful applicants on its own line.