using System;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using System.IO;

class Program
{
    static void Main()
    {
        new Magatro().Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;

    private string[] S;
    private int Index;
    private const char Separator = ' ';

    public Scanner(Stream source)
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(source);
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public decimal NextDecimal()
    {
        return decimal.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    int N, A, B;
    long[] V;
    long[,] Try = new long[51, 51]; 

    private void Scan()
    {
        var cin = new Scanner(Console.OpenStandardInput());
        N = cin.NextInt();
        A = cin.NextInt();
        B = cin.NextInt();
        V = cin.LongArray();
    }

    private void Calc()
    {
        Try[0,0] = 1;
        for (int i = 1; i <= 50; i++)
        {
            for (int j = 0; j <= i; j++)
            {
                if (j == 0 || j == i) Try[i, j] = 1;
                else
                {
                    Try[i, j] = Try[i - 1, j] + Try[i - 1, j - 1];
                }
            }
        }
    }

    private long Conbi(int n ,int r)
    {
        return Try[n , r ];
    }

    public void Solve()
    {
        Scan();
        Calc();
        Array.Sort(V, (a, b) => -a.CompareTo(b));
        long sum = 0;
        var d = new Dictionary<long, int>();
        foreach(long l in V)
        {
            d[l] = 0;
        }

        foreach(long l in V)
        {
            d[l]++;
        }
        int cnt = 0;
        long ll = -1;
        for (int i = 0; i < A; i++)
        {
            sum += V[i];
            if (ll != V[i])
            {
                cnt = 0;
                ll = V[i];
            }
            cnt++;
        }

        Console.WriteLine("{0:f9}",(decimal)sum / A);

        if (V[0] == V[A - 1])
        {
            long ans = 0;
            for (int i = A; i <= B; i++)
            {
                ans += Conbi(d[V[0]], i);
            }
            Console.WriteLine(ans);
        }
        else
        {
            Console.WriteLine(Conbi(d[V[A - 1]], cnt));
        }
    }




    long Pow(long a, long b)
    {
        long result = 1;
        while (b > 0)
        {
            if (b % 2 == 1)
            {
                result *= a;
            }
            b /= 2;
            a *= a;
        }
        return result;
    }

}


Measured memory_bytes: 13536