#include<bits/stdc++.h>
#define int long long
const int inf=1145141919;
const int dd[]={0,-1,0,1,0};
using namespace std;
int p[50];
int ct[51][51];
int combi(int n,int m){
	if(ct[n][m]==-1)
		ct[n][m]=combi(n-1,m)+combi(n-1,m-1);
	return ct[n][m];
}
signed main(){
	fill((int*)ct,(int*)ct+51*51,-1);
	for(int i=0;i<51;i++){
		ct[i][0]=1;
		ct[i][i]=1;
	}
	int n,a,b;
	int i;
	cin>>n>>a>>b;
	for(i=0;i<n;i++)
		cin>>p[i];
	sort(p,p+n);
	reverse(p,p+n);
	int u,v;
	for(i=a-1;i>=0;i--)
		if(p[i]!=p[a-1])
			break;
	u=i+1;
	for(i=a;i<n;i++)
		if(p[i]!=p[a-1])
			break;
	v=i;
	int x=0;
	for(i=0;i<a;i++)
		x+=p[i];
	cout<<fixed<<setprecision(15)<<(double)x/a<<endl;
	if(u==0){
		x=0;
		for(i=a;i<=min(v,b);i++)
			x+=combi(v,i);
		cout<<x<<endl;
	}else
		cout<<combi(v-u,a-u)<<endl;
}
