#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define REP(i,n) FOR(i,0,n)

#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)

using ll = long long;

ll C[51][51];
void comb(int n){
  REP(i,n+1) REP(j,i+1) {
    if (j == 0 || j==i) C[i][j] = 1;
    else C[i][j] = C[i-1][j-1] + C[i-1][j];
  }
}

int main() {
  ll n, a, b; cin >> n >> a >> b;
  vector<ll> v(n); REP(i,n) cin >> v[i];
  whole(sort,v,greater<ll>());
  comb(n);
  double ave = 0.0; REP(i,a) ave += v[i];
  ave /= (double)a;
  ll cnt1 = 0, cnt2 = 0;
  REP(i,n) {
    if (v[i] == v[a-1]) {
      cnt1++;
      if (i < a) cnt2++;
    }
  }
  ll ans = 0;
  if (cnt2 == a) {
    FOR(i,a,b+1) ans += C[cnt1][i];
  } else {
    ans += C[cnt1][cnt2];
  }
  cout << setprecision(20);
  cout << ave << endl;
  cout << ans << endl;
  return 0;
}
