#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define PI (acos(-1))
template<typename T> inline T power(T x, T n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

class Combination{
public:
	ll N;
	// Combination table : nCk = c[n][k]
	vector<vector<ll>> c;

	// テーブルを作る
	Combination(ll n) : N(n), c(n+1, vector<ll>(n+1, 0)){
		for(int i=0; i<=N; ++i){
			for(int j=0; j<=i; ++j){
				if(j==0 || j==i){
					c[i][j] = 1LL;
				}else{
					c[i][j] = c[i-1][j-1] + c[i-1][j];
				}
			}
		}
	}

	// 二項係数を返す
	ll nCk(ll n, ll k){
		return c[n][k];
	}
};

constexpr ll N_MAX = 50;
constexpr ll V_I_MAX = 1000000000000000;

ll N, A, B;
ll v[N_MAX];

void input() {
	scanf("%lld%lld%lld", &N, &A, &B);
	rep(i, N) scanf("%lld", v + i);
}

void solve() {
	Combination com(50);

	map<ll,ll> m;
	rep(i,N){
		m[-v[i]]++;
	}

	ll count=0;
	ll kindcount=0;
	map<ll,ll> buy;
	for(auto item:m){
		if(count+item.second<=A){
			buy[item.first]=item.second;
			count+=item.second;
			kindcount++;
			if(count==A)break;
		}else{
			buy[item.first]=A-count;
			count=A;
			kindcount++;
			break;
		}
	}

	double ave=0.0;
	for(auto b:buy){
		ave+=b.first*b.second;
	}
	ave/=-A;

	ll ans=0;
	if(kindcount==1){
		ll bfirst;
		for(auto b:buy){
			bfirst=b.first;
		}
		for(ll i=A;i<=B;i++){
			ans+=com.nCk(m[bfirst],i);
		}
	}else{
		ll tt=1;
		for(auto b:buy){
			tt*=com.nCk(m[b.first],b.second);
		}
		ans=(ll)tt;
	}
	printf("%.6f\n", ave);
	printf("%lld\n", ans);
}

signed main() {
	input();
	solve();
	return 0;
}


Measured memory_bytes: 256