#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,v) for(auto i=v.begin();i!=v.end();++i)
#define REACH(i,v) for(auto i=v.rbegin();i!=v.rend();++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (lower_bound(ALL(c),x)-upper_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DEL(v) decltype(v)().swap(v)
#define DUMP(x)  cerr<<#x<<" = "<<(x)<<endl;
#define NL cerr<<endl;
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T sum(vector<T>&v){return accumulate(ALL(v),T());}
template<typename T>T sum(vector<T>&v,int a,int b){return accumulate(v.begin()+a,v.begin()+b,T());}
template<typename T>T max(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T min(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T max_index(vector<T>&v){return distance((v).begin(),max_element(ALL(v)));}
template<typename T>T min_index(vector<T>&v){return distance((v).begin(),min_element(ALL(v)));}

struct edge { int to, cost; };

template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}

const int INF = 1e18;
const int MOD_N = 1e9+7;

vector<vector<int>> C;
void init_comb(int N) {
   C.resize(N+1, vector<int>(N+1));
   for (int i = 0; i <= N; i++) {
      for (int j = 0; j <= i; j++) {
         if (j == i || j == 0) {
            C[i][j] = 1;
         } else {
            C[i][j] = C[i-1][j-1] + C[i-1][j];
         }
      }
   }
}

signed main()
{
   int N, A, B; cin >> N >> A >> B;
   map<int,int> mp;
   REP(i, N) {
      int v; cin >> v;
      mp[v]++;
   }

   V<P<int,int>> cnt;
   EACH(i, mp) {
      cnt.PB(MP(i->first, i->second));
   }
   RSORT(cnt);

   init_comb(N);
   if (cnt[0].second >= A) {
      // you can choose A, A+1, ..., min(B,cnt[0].second) items
      int sum = 0;
      int m = min(B, cnt[0].second);
      FORE(i, A, m) {
         sum += C[cnt[0].second][i];
      }
      printf("%.9lf\n", (double)cnt[0].first);
      cout << sum << endl;
      return 0;
   }

   int vsum = 0, nsum = 0;
   EACH(i, cnt) {
      int v = i->first, n = i->second;
      if (A > nsum + n) {
         nsum += n;
         vsum += v * n;
         continue;
      }
      vsum += v * (A - nsum);
      printf("%.9lf\n", (double)vsum / A);
      cout << C[n][A - nsum] << endl;
      return 0;
   }

   return 0;
}

Measured memory_bytes: 256