from math import factorial



def comb(n, k):

    f = factorial

    return f(n) / f(k) / f(n-k)



N, A, B = list(map(int, input().split()))

v = list(map(int, input().split()))



v.sort(reverse = True)



print(float(sum(v[0:A]))/A)



X, Y = 0, 0

ans = 0



for i in range(N):

    if (v[i] == v[A-1]):

        X += 1

    if (v[i] == v[A-1]) and (i < A):

        Y += 1



if (v[0] != v[A-1]):

    ans = comb(X, Y)



else:

    for i in range(A, B+1):

        if(i <= X):

            ans += comb(X, i)



print(ans)
from math import factorial



def comb(n, k):

    f = factorial

    return f(n) / f(k) / f(n-k)



N, A, B = list(map(int, input().split()))

v = list(map(int, input().split()))



v.sort(reverse = True)



t = v[A-1]



ans = 0

X, Y = v.count(t), v[:A].count(t)



if (v[0] != v[A-1]):

    ans = comb(X, Y)



else:

    for i in range(A, B+1):

        if(i <= X):

            ans += comb(X, i)



print(float(sum(v[0:A]))/A)

print(ans)
from math import factorial


def comb(n, k):
    f = factorial
    return f(n) / f(k) / f(n - k)


N, A, B = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort(reverse=True)
print(float(sum(v[0:A])) / A)
X, Y = 0, 0
ans = 0
for i in range(N):
    if v[i] == v[A - 1]:
        X += 1
    if (v[i] == v[A - 1]) and (i < A):
        Y += 1
if v[0] != v[A - 1]:
    ans = comb(X, Y)
else:
    for i in range(A, B + 1):
        if i <= X:
            ans += comb(X, i)
print(ans)

from math import factorial


def comb(n, k):
    f = factorial
    return f(n) / f(k) / f(n - k)


N, A, B = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort(reverse=True)
t = v[A - 1]
ans = 0
X, Y = v.count(t), v[:A].count(t)
if v[0] != v[A - 1]:
    ans = comb(X, Y)
else:
    for i in range(A, B + 1):
        if i <= X:
            ans += comb(X, i)
print(float(sum(v[0:A])) / A)
print(ans)

-print(float(sum(v[0:A])) / A) -X, Y = 0, 0 +t = v[A - 1] -for i in range(N): -    if v[i] == v[A - 1]: -        X += 1 -    if (v[i] == v[A - 1]) and (i < A): -        Y += 1 +X, Y = v.count(t), v[:A].count(t) +print(float(sum(v[0:A])) / A)