#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n, A, B, v[55], ans;
double res;

ll com(ll x, ll y){
    ll res = 1;
    for (ll i = 0; i < y; i++) {
        res *= (x - i);
        res /= i + 1;
    }
    return res;
}

int main(void){
    // Your code here!
    cin >> n >> A >> B;
    for (ll i = 0; i < n; i++) cin >> v[i];
    sort(v, v + n);
    reverse(v, v + n);
    for (ll i = 0; i < A; i++) {
        res += v[i];
    }
    cout << fixed << res / A << endl;
    if (v[0] == v[A - 1]) {
        ll k = A;
        while(v[k] == v[k - 1]) k++;
        for (ll i = A; i <= k && i <= B; i++) {
            ans += com(k, i);
        }
        cout << ans << endl;
    } else {
        ll k = 1, l = 1, i = A, j = A;
        while(v[i - 1] == v[i - 2]){
            i--, k++, l++;
        }
        while(v[j - 1] == v[j]){
            j++, k++;
        }
        cout << com(k, l) << endl;
    }
}
