#include <bits/stdc++.h>

template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {};

template <typename T, typename = void>
struct is_pair : std::false_type {};
template <typename T>
struct is_pair<T, std::void_t<decltype(std::declval<T>().first),
                              decltype(std::declval<T>().second)>>
    : std::true_type {};

template <typename T>
void debug(T&& v) {
  if constexpr (is_pair<T>::value) {
    std::cerr << "{";
    debug(v.first);
    std::cerr << ", ";
    debug(v.second);
    std::cerr << "}";
  } else if constexpr (is_iterable<T>::value &&
                       !std::is_same<T, std::string>::value) {
    std::cerr << "{";
    for (auto it = std::begin(v); it != std::end(v); ++it) {
      if (it != std::begin(v)) std::cerr << ", ";
      debug(*it);
    }
    std::cerr << "}";
  } else {
    std::cerr << v;
  }
}
template <typename T, typename... Ts>
void debug(T&& value, Ts&&... args) {
  debug(value);
  std::cerr << ", ";
  debug(args...);
}
#if DEBUG
#define dbg(...)                        \
  do {                                  \
    cerr << #__VA_ARGS__ << ": ";       \
    debug(__VA_ARGS__);                 \
    cerr << " (L" << __LINE__ << ")\n"; \
  } while (0)
#else
#define dbg(...)
#endif

void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
  std::cin >> value;
  read_from_cin(args...);
}
#define rd(type, ...) \
  type __VA_ARGS__;   \
  read_from_cin(__VA_ARGS__);
#define ints(...) rd(int, __VA_ARGS__);
#define strings(...) rd(string, __VA_ARGS__);

template <typename T>
void write_to_cout(const T& value) {
  if constexpr (std::is_same<T, bool>::value) {
    std::cout << (value ? "Yes" : "No");
  } else {
    std::cout << value;
  }
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
  write_to_cout(value);
  std::cout << ' ';
  write_to_cout(args...);
}
#define wt(...)                 \
  do {                          \
    write_to_cout(__VA_ARGS__); \
    cout << '\n';               \
  } while (0)

#define all(x) (x).begin(), (x).end()

#define rep_dispatch(_1, _2, _3, name, ...) name
#define rep3(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep2(i, n) rep3(i, 0, n)
#define rep1(n) rep2(_loop_variable_, n)
#define rep(...) rep_dispatch(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)

template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
  for (T& vi : v) is >> vi;
  return is;
}

template <typename T, typename U>
std::istream& operator>>(std::istream& is, std::pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T, typename U>
bool chmax(T& a, U b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T, typename U>
bool chmin(T& a, U b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T>
int sz(const T& v) {
  return v.size();
}

template <typename T>
int popcount(T i) {
  return std::bitset<std::numeric_limits<T>::digits>(i).count();
}

#include <boost/hana/functional/fix.hpp>
const auto& Fix = boost::hana::fix;

using ll = long long;

template <typename T>
using low_priority_queue =
    std::priority_queue<T, std::vector<T>, std::greater<T>>;

template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;

using namespace std;

int main() {
#define int ll
  ints(n, a, b);
  V<int> v(n);
  cin >> v;

  sort(all(v), greater());
  int sum = accumulate(v.begin(), v.begin() + a, 0LL);

  cout << fixed << setprecision(20);
  wt(sum / double(a));

  map<int, int> cnt;
  for (int vi : v) ++cnt[vi];

  auto comb = [](int n, int k) {
    chmin(k, n - k);
    int p = 1, q = 1;
    rep(i, k) {
      p *= n - i;
      q *= k - i;
      int g = gcd(p, q);
      p /= g;
      q /= g;
    }
    assert(q == 1);
    return p;
  };

  // int c = a;
  // while (c < sz(v) && c < b && v[c] == sum / a) ++c;

  int ans = 0;
  rep(i, a - 1, b) {
    int nsum = 0;
    rep(j, a, i + 1) nsum += v[j];
    if (sum * (i - (a - 1)) != nsum * a) continue;
    // sum / a == nsum / (
    // if
    int last = v[i];
    int used = 0;
    rep(j, i + 1) if (v[j] == last)++ used;

    ans += comb(cnt[last], used);
  }
  wt(ans);

  /*
  int nlo = n / 2, nhi = n - nlo;
  VV<int> lo(nlo + 1), hi(nhi + 1);

  dbg(nlo, nhi);

  lo[0].push_back(0);
  rep(s, 1 << nlo) {
    int sum = 0;
    rep(i, nlo) if ((s >> i) & 1) sum += v[i];
    lo[popcount(s)].push_back(sum);
  }
  for (auto&& v : lo) sort(all(v));

  hi[0].push_back(0);
  rep(s, 1 << nhi) {
    int sum = 0;
    rep(i, nhi) if ((s >> i) & 1) sum += v[nlo + i];
    hi[popcount(s)].push_back(sum);
  }
  for (auto&& v : hi) sort(all(v));

  int ans = 0;
  rep(i, nlo + 1) {
    for (int li : lo[i]) {
      rep(j, nhi + 1) {
        if (i + j < a || b < i + j) continue;
        int ri = sum - li;
        auto lb = lower_bound(all(hi[j]), ri);
        if (lb != hi[j].end() && *lb == ri) {
          auto ub = upper_bound(all(hi[j]), ri);
          ans += ub - lb;
        }
      }
    }
  }
  wt(ans);
  */
}


Measured memory_bytes: 3824