In a speech contest, when a contestant finishes his speech, the judges will then grade his performance. The staff remove the highest grade and the lowest grade and compute the average of the rest as the contestant’s final grade. This is an easy problem because usually there are only several judges.

Let’s consider a generalized form of the problem above. Given n positive integers, remove the greatest n₁ ones and the least n₂ ones, and compute the average of the rest.

The input consists of several test cases. Each test case consists two lines. The first line contains three integers n₁, n₂ and n (1 ≤ n₁, n₂ ≤ 10, n₁ + n₂ < n ≤ 5,000,000) separate by a single space. The second line contains n positive integers a_i (1 ≤ a_i ≤ 10⁸ for all i s.t. 1 ≤ i ≤ n) separated by a single space. The last test case is followed by three zeroes.

For each test case, output the average rounded to six digits after decimal point in a separate line.

This problem has very large input data. scanf and printf are recommended for C++ I/O.

The memory limit might not allow you to store everything in the memory.