#include <bits/stdc++.h>

using namespace std;

int N, A, B;
typedef long long ll;
ll v[51];
ll com[53][53];

void init(int N) {
  for(int i = 0; i <= N; i++) {
    com[i][i] = com[i][0] = 1;
  }

  for(int i = 2; i <= N; i++) {
    for(int j = 1; j < i; j++) {
      com[i][j] = com[i-1][j-1] + com[i-1][j];
    }
  }
}

ll nCr(int n, int r) {
  return com[n][r];
}
  
int main() {
  cin >> N >> A >> B;

  init(N);

  for(int i = 0; i < N; i++)  cin >> v[i];
  
  sort(v,v+N,greater<ll>());

  int c = 0;

  
  
  ll ans = 0;
  
  for(int i = 0; i < A; i++) ans += v[i];
  
  cout <<fixed<< ans /(double)A<<endl;

 
  int k = 0; int t = 0;
  ll ans2 = 0;

  for(int i = 0; i < N; i++) {
    if(v[i] == v[A-1]) {
      k++;
      if(i < A) t++;
    }
  }

  if(t == A) {
    for(int i = A; i <= B; i++) {
      ans2 += nCr(k,i);
    }
  }
  else {
    ans2 += nCr(k,t);
  }

  cout << ans2 << endl;
}
    
  
