#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

class Rational{
    private:
        long long gcd(ll a,ll b){
            if(b==0) return a;
            else return gcd(b,a%b);
        }
    public:
        long long n,d;  // n:分子 d:分母
        Rational(long long n_,long long d_) : n(n_),d(d_){
            if(d<0){
                d*=-1;
                n*=-1;
            }
            ll t=gcd(n,d);
            n /= t;
            d /= t;
        }
        Rational operator + (const Rational &r) const {
            ll de=d*r.d;
            ll nu=n*r.d+d*r.n;
            return Rational(nu,de);
        }
        Rational operator - (const Rational &r) const {
            ll de=d*r.d;
            ll nu=n*r.d-d*r.n;
            return Rational(nu,de);
        }
        Rational operator * (const Rational &r) const{
            ll de=d*r.d;
            ll nu=n*r.n;
            return Rational(nu,de);
        }
        bool operator == (const Rational &r) const{
            return (d==r.d and n==r.n);
        }
        bool operator > (const Rational &r) const{
            Rational t=*this-r;
            return t.n>0;
        }
        bool operator < (const Rational &r) const{
            Rational t=*this-r;
            return t.n<0;
        }

        friend ostream& operator << (ostream& os,const Rational &r){
            os << "Rational(" << r.n << "," << r.d << ")";
            return os;
        }
        operator double(){
            return (double)n/(double)d;
        }
};

class C{
    public:
#define MAX_N 64
#define MAX_M 64
        long long comb[64][64];
        C(){
            for(int i=0;i<MAX_N;i++) for(int j=0;j<MAX_N;j++) comb[i][j] = 0;
 
            for(int i=0;i<MAX_N;i++){
                comb[i][0]=1;
                for(int j=1;j<=i;j++){
                    comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
                }
            }
 
        }
 
        long long get(int i,int j){return comb[i][j];}
};

int main(){
    int N,A,B;
    cin>>N>>A>>B;
    vl v(N);
    rep(i,N) cin>>v[i];
    sort(all(v));
    reverse(all(v));

    Rational ans1 = [&](){
        ll sum=0;
        rep(i,A) sum+=v[i];
        return Rational(sum,A);
    }();


    map<ll,ll> mp;
    rep(i,N) mp[v[i]]++;

    C cmb;

    ll ans2=0;
    for(int cnt=A;cnt<=B;cnt++){
        map<ll,ll> mp2;
        ll sum=0;
        rep(i,cnt){
            sum+=v[i];
            mp2[v[i]]++;
        }
        ll po=1;
        for(auto m:mp2){
            ll key=m.first;
            ll val=m.second;
            po*=cmb.get(mp[key],val);
        }
        if(ans1==Rational(sum,cnt)) ans2+=po;
    }
    cout << Double((double)ans1) << endl;
    cout << ans2 << endl;
}


Measured memory_bytes: 256