#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(n);i++)
int gcd(int a,int b){
	if(b==0)return a;
	return gcd(b,a%b);
}
int lcm(int a,int b){
	return a/gcd(a,b)*b;
}
int c[51][51];
void comb(){
    rep(i,51){
        rep(j,i+1){
            if(j==0||j==i)c[i][j]=1;
            else c[i][j]=c[i-1][j-1]+c[i-1][j];
        }
    }
}
int n,a,b,v[50],cnt=0,k=0,s=0,ans=0;
signed main(){
    comb();
    cin>>n>>a>>b;
    rep(i,n)cin>>v[i];
    sort(v,v+n);
    reverse(v,v+n);
    rep(i,n)if(v[i]==v[a-1])k++;
    rep(i,a)if(v[a-1]==v[i])s++;
    rep(i,a)cnt+=v[i];
    printf("%.12lf\n",1.0*cnt/a);
    if(v[0]==v[a-1]){
        for(int i=a;i<=min(b,k);i++)ans+=c[k][i];
        cout<<ans<<endl;
    }
    else cout<<c[k][s]<<endl;
	return 0;
}