using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Threading.Tasks;
using System.Collections.Generic;
using System.Runtime.InteropServices;
using static System.Console;
using static System.Math;

namespace NotFounds
{
    public class Program
    {
        public static void Main(string[] args)
        {
            new Program().Solve();
        }

        public void Solve()
        {
            var cin = new MyInputStream();
            var N = cin.ReadInt();
            var A = cin.ReadInt();
            var B = cin.ReadInt();
            var v = new List<long>();

            for (int i = 0; i < N; ++i)
                v.Add(cin.ReadLong());

            var sorted = v.OrderBy(val => val).Reverse().ToList();
            var maxAve = 0.0;
            var maxSum = 0.0;
            for (int i = 0; i < A; ++i)
                maxSum += sorted[i];
            maxAve = maxSum / A;

            WriteLine(maxAve.ToString("F8"));

            var cnt = 0;
            var idx = 0;
            for (int i = 0; i < N; ++i)
            {
                if (sorted[i] == sorted[A - 1])
                    cnt++;
                else if (sorted[i] > sorted[A - 1])
                    idx++;
            }

            if (sorted[0] == sorted[A - 1])
            {
                ulong sum = 0;
                for (int i = A; i <= B; ++i)
                    sum += nCm((ulong)cnt, (ulong)i);
                WriteLine(sum.ToString("D"));
            }
            else WriteLine(nCm((ulong)cnt, (ulong)(A - idx)).ToString("D"));
        }

        public ulong nCm(ulong n, ulong m)
        {
            ulong r = 1;
            for (ulong d = 1; d <= m; ++d)
            {
                r *= n--;
                r /= d;
            }
            return r;
        }
    }

    public class MyInputStream
    {
        private char separator = ' ';
        private Queue<string> inputStream;
        public MyInputStream(char separator = ' ')
        {
            this.separator = separator;
            inputStream = new Queue<string>();
        }

        public string Read()
        {
            if (inputStream.Count != 0) return inputStream.Dequeue();
            string[] tmp = Console.ReadLine().Split(separator);
            for (int i = 0; i < tmp.Length; i++)
            {
                inputStream.Enqueue(tmp[i]);
            }
            return inputStream.Dequeue();
        }
        public string ReadLine() => Console.ReadLine();
        public int ReadInt() => int.Parse(Read());
        public long ReadLong() => long.Parse(Read());
        public double ReadDouble() => double.Parse(Read());
    }

    public class Pair<T1, T2>
    {
        public T1 First;
        public T2 Second;
        public Pair() { First = default(T1); Second = default(T2); }
        public Pair(T1 f, T2 s) { First = f; Second = s; }
        public override string ToString() { return "(" + First + ", " + Second + ")"; }
        public override int GetHashCode() { return First.GetHashCode() ^ Second.GetHashCode(); }
        public override bool Equals(object obj)
        {
            if (ReferenceEquals(this, obj)) return true;
            else if (obj == null) return false;
            var tmp = obj as Pair<T1, T2>;
            return (object)tmp != null && First.Equals(tmp.First) && Second.Equals(tmp.Second);
        }
    }

    #region HashMap
    public class HashMap<K, V> : Dictionary<K, V>
    {
        public HashMap() : base() { }
        public HashMap(int cap) : base(cap) { }
        public HashMap(IDictionary<K, V> dictionary) : base(dictionary) { }
        new public V this[K i]
        {
            get
            {
                V v;
                return TryGetValue(i, out v) ? v : base[i] = default(V);
            }
            set { base[i] = value; }
        }
    }
    #endregion
}


Measured memory_bytes: 13524