#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template<typename T>
istream& operator >>(istream& is, vec<T>& v) {
    lint size = v.size();
    range(i, 0, size){
        is >> v.at(i);
    }
    return is;
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

lint combination(int n, int m, vec<vec<lint>>& memo) {
    if (memo.at(n).at(m) != -1) return memo.at(n).at(m);
    lint res;
    if (m == n || m == 0 || n == 1) res = 1;
    else {
        res = combination(n - 1, m, memo) + combination(n - 1, m - 1, memo);
    }
    memo.at(n).at(m) = res;
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N, A, B;
    cin >> N >> A >> B;
    vec<lint> v_list(N);
    cin >> v_list;
    sort(v_list.begin(), v_list.end(), greater<lint>());
    lint sum = 0;
    range(i, 0, A) sum += v_list.at(i);
    lint smallest_val = v_list.at(A - 1);
    lint num_smallest_in = count(v_list.begin(), v_list.begin() + A, smallest_val);
    lint num_smallest = count(v_list.begin(), v_list.end(), smallest_val);
    vec<vec<lint>> memo(100, vec<lint>(100, -1));
    if (v_list.at(0) != smallest_val) {
        cout << (double)sum / A << "\n";
        cout << combination(num_smallest, num_smallest_in, memo) << "\n";
        return 0;
    }
    lint total_count = 0;
    range(i, A - 1, B) {
        if (v_list.at(i) == smallest_val)
            total_count += combination(num_smallest, num_smallest_in + i - (A - 1), memo);
    }
    cout << (double)sum / A << "\n";
    cout << total_count << "\n";
}


Measured memory_bytes: 384