#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll C[51][51]={};
void comb(int n){
	for(int i=0;i<=n;i++){
		for(int j=0;j<=i;j++){
			if(j==0||j==i) C[i][j]=1LL;
			else C[i][j]=C[i-1][j-1]+C[i-1][j];
		}
	}
}

int main(){
	int n,a,b;
	cin >> n >> a >> b;
	ll v[50];
	for(int i=0;i<n;i++) cin >> v[i];
	sort(v,v+n);
	reverse(v,v+n);

	comb(n);

	double ans=0;
	for(int i=0;i<a;i++) ans+=v[i];
	ans/=a;

	ll num=0LL;
	int nn=0,rr=0;
	for(int i=0;i<n;i++){
		if(v[i]==v[a-1]){
			nn++;
			if(i<a) rr++;
		}
	}
	if(rr==a){
		for(rr;rr<=b;rr++) {
			num+=C[nn][rr];
		}
	}else num+=C[nn][rr];

	cout.precision(20);
	cout << fixed << ans << endl;
	cout << num << endl;
}
