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 CPP):

Solution:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long n, a, b, s, x, y, v[55], c[55][55]={1};
int main() {
	int i, j;
	cin>>n>>a>>b;
	for(i=0; i<n; i++) cin>>v[i];
	sort(v, v+n);
	for(i=n-1; i>=n-a; i--) s += v[i];
	printf("%.9f\n", 1.*s/a);
	x = upper_bound(v, v+n, v[n-a]) - lower_bound(v, v+n, v[n-a]);
	for(i=1; i<=x; i++) {
		c[i][0] = 1;
		for(j=1; j<=x; j++) c[i][j] = c[i-1][j-1] + c[i-1][j];
	}
	if(v[n-a] != v[n-1]) {
		y = upper_bound(v+n-a, v+n, v[n-a]) - lower_bound(v+n-a, v+n, v[n-a]);
		cout<<c[x][y];
	} else {
		s = 0;
		for(i=a; i<=min(x, b); i++)
			s += c[x][i];
		cout<<s;
	}
	return 0;
}