#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <set>
#include <unordered_map>

#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

using namespace std;

#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define repx(i,s,d,e) for(int i=s,i##_end=(e);i<i##_end;i+=d)
#define repxr(i,s,d,e) for(int i=s,i##_end=(e);i>i##_end;i+=d)
#define rept(n) for(int ___i___=0,i##_len=(n);___i___<i##_len;++___i___)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a,0,sizeof(a))
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end());
#define CEIL(x, y) (((x) + (y) - 1) / (y))

// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#define DUMPOUT cout
void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef LOCAL_
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

typedef long long int lli;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int> > heapq;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
struct aaa{
    aaa(){
        cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);
    };
}aaaaaaa;

signed main() {
    int N, A, B; cin >> N >> A >> B;
    vector<lli> v(N); cin >> v;
    sort(ALL(v), greater<lli>());

    lli sum = 0;
    rep(i, A) {
        sum += v[i];
    }
    double ave = (double)sum / (double)A;

    if (N == A) {
        cout << ave << endl;
        cout << 1 << endl;
        return 0;
    }

    if (v[A - 1] != v[A]) {
        cout << ave << endl;
        cout << 1 << endl;
        return 0;
    }

    int aSpace = 0, bSpace = 0;
    rep(i, B) {
        if (v[i] == v[A - 1]) {
            if (i < A) aSpace++;
            bSpace++;
        }
    }
    int cnt = 0;
    rep(i, N) {
        if (v[i] == v[A - 1]) {
            cnt++;
        }
    }
    dump(cnt, aSpace, bSpace);

    lli C[51][51]; C[0][0] = 1;
    repx(i, 1, 1, 51) {
        C[i][0] = 1;
        repx(j, 1, 1, 50) {
            C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
        }
        C[i][50] = 1;
    }

    lli com = 0;
    repx(i, A - 1, 1, B) {
        com += C[cnt][aSpace++];
        if (v[i] != v[0]) break;
    }
    cout << ave << endl;
    cout << com << endl;
    return 0;
}


Measured memory_bytes: 888