#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>
#include <bitset>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    ll weight;
    Edge(int t, ll w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    ll weight;
    edge(int f,int t,ll w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}

constexpr ll LNF = 1LL<<50;

constexpr int INF = 1e9+7;

const long double PI=3.14159265358979323846;


vector<int> dx = {1,0,-1,1,-1,0};
vector<int> dy = {1,1,1,0,0,-1};

/* template */

struct combination{
    vector<vector<ll>> c;
    combination() : c(60,vector<ll>(60)){
        rep(i,0,60){
            rep(j,0,i+1){
                if(j==0 || j==i){
                    c[i][j] = 1ll;
                }
                else{
                    c[i][j] = (c[i-1][j-1]+c[i-1][j]);
                }
            }
        }
    }

    ll operator ()(ll n, ll k){
        return c[n][k];
    }
} comb;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,a,b; cin >> n >> a >> b;
    vector<ll> v(n);
    map<ll,ll> m;
    rep(i,0,n){
        cin >> v[i];
        m[v[i]]++;
    }
    sort(rall(v));
    double sum = 0.0;
    ll k = a;
    rep(i,0,a){
        sum += (double)v[i];
        if(v[a-1]!=v[i]){
            k--;
        }
    }
    ll ans = 0;
    ll t = m[v[a-1]];
    if(k==a){
        ll l = min(t+1ll,b+1ll);
        rep(i,a,l){
            ans += comb(t,i);
        }
        cout << v[a-1] << endl;
        cout << ans << endl;
        return 0;
    }
    setprecision(20);
    sum /= (double)a;
    cout << fixed << sum << endl;
    ans = comb(t,k);
    debug(t,k,comb(t,k));
    cout << ans << endl;
}

Measured memory_bytes: 3816