#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
for (auto &i : v) is >> i;
return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
const string delimiter = "\n";
REP(i, v.size())
{
os << v[i];
if (i != v.size() - 1) os << delimiter;
}
return os;
}
/*--------------------template--------------------*/
ll comb(ll a, ll b)
{
if (a < b) return 0;
ld res = 1;
REP(i, b)
{
res *= a - i;
res /= i + 1;
}
return res;
}
int main()
{
cin.sync_with_stdio(false); cout << fixed << setprecision(10);
int n, a, b;
cin >> n >> a >> b;
vi v(n); cin >> v;
sort(v.rbegin(), v.rend());
ll av = 0;
REP(i, a) av += v[i];
cout << av / ld(a) << endl;
ll tar = v[a - 1];
int cnt = count(ALL(v), tar);
int used = 0;
REP(i, a)
{
if (v[i] == tar) used++;
}
ll ans = 0;
if (v[0] != tar)
{
ans += comb(cnt, used);
}
else
{
FOR(i, a, min(cnt, b) + 1)
{
ans += comb(cnt, i);
}
}
cout << ans << endl;
return 0;
}