Problem: You are given N items.
The value of the i-th item (1 \leq i \leq N) is v_i.
Your have to select at least A and at most B of these items.
Under this condition, find the maximum possible arithmetic mean of the values of selected items.
Additionally, find the number of ways to select items so that the mean of the values of selected items is maximized.

Constraints

* 1 \leq N \leq 50
* 1 \leq A,B \leq N
* 1 \leq v_i \leq 10^{15}
* Each v_i is an integer.

Input

The input is given from Standard Input in the following format:


N A B
v_1
v_2
...
v_N


Output

Print two lines.
The first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.
The second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.

Examples

Input

5 2 2
1 2 3 4 5


Output

4.500000
1


Input

4 2 3
10 20 10 10


Output

15.000000
3


Input

5 1 5
1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996


Output

1000000000000000.000000
1

Solution (in JAVA):

Solution:

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskX {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			int a = in.nextInt();
			int b = in.nextInt();
			Long[] v = new Long[n];
			for (int i = 0; i < n; i++) {
				v[i] = in.nextLong();
			}
			Arrays.sort(v, Comparator.reverseOrder());

			double ansAvg = 0;
			for (int i = 0; i < a; i++) {
				ansAvg += v[i];
			}
			ansAvg /= a;
			out.println(String.format("%1$.6f", ansAvg));


			long ansCount = 0;
			int x = 0;
			int y = 0;
			for (int i = 0; i < n; i++) {
				if (v[a-1].equals(v[i])) x++;
			}
			for (int i = 0; i < a; i++) {
				if (v[a-1].equals(v[i])) y++;
			}
			if (v[0].equals(v[a-1])) {
				int min = Math.min(x, b);
				for (int i = a; i <= min; i++) {
					ansCount += countCombination(x, i);
				}
			} else {
				ansCount += countCombination(x, y);
			}
			out.println(ansCount);

		}
	}

	static long countCombination(long n, long r) {
		r = Math.min(r, n-r);
		BigInteger numerator = new BigInteger("1");
		BigInteger donominator = new BigInteger("1");

		for (long i = n; i > n-r; i--) {
			BigInteger is = new BigInteger(String.valueOf(i));
			numerator = numerator.multiply(is);
		}
		for (long i = 1; i <= r; i++) {
			BigInteger is = new BigInteger(String.valueOf(i));
			donominator = donominator.multiply(is);
		}
		return numerator.divide(donominator).longValue();
	}

	static class ArrayUtils {
		public static Map<Integer, Integer> getCountMap(int[] array) {
			Map<Integer, Integer> map = new TreeMap<>();
			for (int x : array)
				map.merge(x, 1, Integer::sum);
			return map;
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}

	}

}