#[allow(unused_imports)]
use std::cmp::Ordering;

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get {
    ([$t: ty]) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

#[derive(Eq, PartialEq, Clone, Debug)]
pub struct Rev<T>(pub T);
impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}
impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

struct Comb {
    raw: Vec<Vec<usize>>,
}
impl Comb {
    fn new(nmax: usize) -> Self {
        Comb {
            raw: vec![vec![0; nmax + 1]; nmax + 1],
        }
    }
    fn compute(&mut self, n: usize, k: usize) -> usize {
        let k = min!(k, n - k);
        if self.raw[n][k] != 0 {
            return self.raw[n][k];
        }
        let res = if k == 0 || k == n {
            1
        } else if k == 1 {
            n
        } else {
            self.compute(n - 1, k - 1) + self.compute(n - 1, k)
        };
        self.raw[n][k] = res;
        res
    }
}

fn solve() {
    let (n, a, b) = get!(usize, usize, usize);
    let mut v = get!([usize]);
    v.sort_by_key(|&e| Rev(e));

    let mut maps = vec![BTreeMap::new(); n + 1];
    let mut sums = vec![0; n + 1];
    for i in 0..n {
        maps[i + 1] = maps[i].clone();
        *maps[i + 1].entry(v[i]).or_insert(0) += 1;
        sums[i + 1] = sums[i] + v[i];
    }

    let mut comb = Comb::new(n);

    sums[a - 1] = 0;
    let mut res = 0;
    for i in a..b + 1 {
        if sums[i] * (i - 1) < sums[i - 1] * i {
            break;
        }
        let (&k, &v) = maps[i].iter().next().unwrap();
        let all = maps[n].get(&k).cloned().unwrap();
        res += comb.compute(all, v);
    }

    println!("{}", sums[a] as f64 / a as f64);
    println!("{}", res);
}


Measured memory_bytes: 8572