//file_name:ABC57_D.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

    // int scan
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&z);

    // matrix scan
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // string scan
    /*
    string s;
    cin >> s;
    */

void comb(vector<vector <long long int> > &v){
    for(int i = 0;i <v.size(); i++){
        v[i][0]=1;
        v[i][i]=1;
    }
    for(int k = 1;k <v.size();k++){
        for(int j = 1;j<k;j++){
            v[k][j]=(v[k-1][j-1]+v[k-1][j]);
        }
    }
}

int main() {
    int n,a,b;
    scanf("%d%d%d",&n,&a,&b);
    ll aa[n] = {};
    rep(i,n){
        scanf("%lld",&aa[i]);
    }
    sort(aa,aa+n);
    ll ans = 0;
    rep(i,a){
        ans += aa[n-1-i];
    }
    double anss = (double)ans / a;
    cout << fixed;
    cout << anss << endl;


    ll kumi = 0;
    if(a==n||aa[n-a]!=aa[n-a-1]){
        cout << kumi+1 << endl;
        return 0;
    }

    rep(i,n/2){
        swap(aa[i],aa[n-1-i]);
    }

    int start = a-1;
    int end = a-1;
    while(0<start&&aa[start-1]==aa[a-1]){
        start--;
    }
    while(end<n-1&&aa[end+1]==aa[a-1]){
        end++;
    }

    if(start!=0){
        int N = end-start+1;
        vector<vector<long long int> > V(N+1,vector<long long int>(N+1,0));
        comb(V);
        kumi = V[N][a-1-start+1];
        cout << kumi << endl;
        return 0;
    }

    if(end<=b-1){
        int N = end-start+1;
        vector<vector<long long int> > V(N+1,vector<long long int>(N+1,0));
        comb(V);
        srep(i,a-1,end+1){
            kumi += V[N][i-start+1];
        }
        cout << kumi << endl;
    }else{
        int N = end-start+1;
        vector<vector<long long int> > V(N+1,vector<long long int>(N+1,0));
        comb(V);
        srep(i,a-1,b){
            kumi += V[N][i-start+1];
        }
        cout << kumi << endl;
    }

    
    //cout << start << a-1 << end;
    return 0;
}



Measured memory_bytes: 256