#include <iostream>
#include <cstdio>
using namespace std;

typedef long long ll;
ll n, st, en, x1, x2, ans, d[55], s[55];
ll f(ll p1, ll q1, ll p2, ll q2) {
	if (q1 * p2 < q2 * p1) return 1;
	else if (q1 * p2 == q2 * p1) return 2;
	else return 3;
}
int main()
{
	ll i, j, a;
	cin >> n >> st >> en;
	s[0] = 1;
	for (i = 1; i <= n; i++) {
		scanf("%lld", &a);
		for (j = i; j >= 1; j--) {
			if (d[j - 1] + a > d[j]) s[j] = s[j - 1];
			else if (d[j - 1] + a == d[j]) s[j] += s[j - 1];
			d[j] = max(d[j], d[j - 1]+ a);
		}
	}
	x1 = st;
	x2 = d[st];
	ans = s[st];
	for (i = st + 1; i <= en; i++) {
		ll t= f(x1, x2, i, d[i]);
		if (t == 1) {
			x1 = i;
			x2 = d[i];
			ans = s[i];
		} else if (t == 2) ans += s[i];
	}
	printf("%.10f\n%lld", (double)x2 / x1, ans);
    return 0;
}
