//  ____            _                  _                       _       _
// |  _ \ _   _ ___| |_    ___ _ __   | |_ ___ _ __ ___  _ __ | | __ _| |_ ___
// | |_) | | | / __| __|  / __| '_ \  | __/ _ \ '_ ` _ \| '_ \| |/ _` | __/ _ \
// |  _ <| |_| \__ \ |_  | (__| |_) | | ||  __/ | | | | | |_) | | (_| | ||  __/
// |_| \_\\__,_|___/\__|  \___| .__/___\__\___|_| |_| |_| .__/|_|\__,_|\__\___|
//                            |_| |_____|               |_|

//https://github.com/manta1130/Competitive_Programming_Template_Rust

#[macro_use]
mod input {

    use std;
    use std::io;

    const SPLIT_DELIMITER: char = ' ';

    #[macro_export]
    #[allow(unused_macros)]
    macro_rules! input {
    ( $($x:expr ),*) => {
        {
            let temp_str = input_line_str();
            let mut split_result_iter = temp_str.split_whitespace();
                $(
                let buf_split_result = split_result_iter.next();
                let buf_split_result = buf_split_result.unwrap();
                    ($x) = buf_split_result.parse().unwrap();
                )*
        }
    };
}

    #[allow(dead_code)]
    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn p<T>(t: T)
    where
        T: std::fmt::Display,
    {
        println!("{}", t);
    }

    #[allow(dead_code)]
    pub fn input_vector2d<T>(line: usize) -> Vec<Vec<T>>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<Vec<T>> = Vec::new();

        for _ in 0..line {
            let vec_line = input_vector();
            v.push(vec_line);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}

use input::*;
use std::collections::HashMap;

fn comb(n: usize, k: usize) -> usize {
    let mut res = 1;
    if n < k {
        return 0;
    }
    let mut j = 1;
    for i in (n - k + 1..n + 1).rev() {
        res *= i;
        res /= j;
        j += 1;
    }
    return res as usize;
}

fn main() {
    let (n, a, b): (usize, usize, usize);
    input!(n, a, b);
    let mut v = input_vector::<usize>();
    v.sort();
    v.reverse();
    let mut d = HashMap::new();
    for i in &v {
        *d.entry(i).or_insert(0) += 1;
    }
    let mut sum = vec![];
    let mut max_av = 0;
    let mut max_count = 999;
    let mut c = vec![];
    for i in a..b + 1 {
        let buf = v.iter().take(i).sum::<usize>();
        let min = v.iter().take(i).min().unwrap();
        let mincount = v.iter().take(i).filter(|&x| x == min).count();
        c.push(comb(d[min], mincount));
        if (max_av as f64 / max_count as f64) < (buf as f64 / i as f64) {
            max_av = buf;
            max_count = i;
        }
        sum.push(buf);
    }

    let mut ans = 0;
    for i in 0..sum.len() {
        if sum[i] * max_count == max_av * (a + i) {
            ans += c[i];
        }
    }
    println!("{}", max_av as f64 / max_count as f64);
    println!("{}", ans);
}


Measured memory_bytes: 4352