#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;

const int NMAX = 50;
ll gBinom[NMAX + 1][NMAX+1];

void CalcBinom(int n)
{
	for (int i = 1; i <= n; i++)
	{
		gBinom[i][1] = i;
		for (int j = 2; j <= i; j++)
		{
			gBinom[i][j] = gBinom[i - 1][j] + gBinom[i - 1][j - 1];
		}
	}
}

int main()
{
	int N, A, B;
	scanf("%d%d%d", &N, &A, &B);
	CalcBinom(N);
	ll nums[NMAX];
	for (int i = 0; i < N; ++i)
	{
		scanf("%lld", &nums[i]);
	}

	sort(nums, nums + N, greater<ll>());
	double s = 0.0;
	for (int i = 0; i < A; ++i)
		s += nums[i];
	printf("%.20lf\n", s / A);

	const ll val = nums[A - 1];
	int ccc[2] = { 0, 0 };
	for (int i = 0; i < N; ++i)
	{
		if (nums[i] == val)
			++ccc[i >= A];
	}
	int u = ccc[0] + ccc[1];
	ll cnt = 0;
	if (val == nums[0])
	{
		for (int i = A; i <= B; ++i)
			cnt += gBinom[u][i];
	}
	else
		cnt = gBinom[u][ ccc[0] ];
	printf("%lld\n", cnt);
	return 0;
}
