#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll INF = 1e18;
int MOD = 1e9+7;
ll combi(ll n,ll r){
    ll num = 1;
    for(ll i = 1;i <= r;i++){
        num = (n-i+1)*num / i;
    }
    return num;
}
int main(){
    int N,A,B;
    cin >> N >> A >> B;
    vector<ll> V(N);
    map<ll,int> mp;
    for(int i = 0;i < N;i++){
        cin >> V[i];
        mp[V[i]]++;
    }
    sort(V.rbegin(),V.rend());
    ll sum = 0,ans = 0;
    for(int i = 0;i < A;i++)sum += V[i];
    for(int i = A;i <= B;i++){
        map<ll,int>tmp;
        ll minv = INF;
        for(int j = 0;j < i;j++){
            tmp[V[j]]++;
            minv = min(minv,V[j]);
        }
        if(i != A && tmp.size() != 1)break;
        ans += combi(mp[minv],tmp[minv]);
    }
    printf("%.6lf\n",1. * sum / A);
    cout << ans << endl;
}