var n,i,j,a,b,tot1,tot2,left:longint;
v:array[0..57] of int64;
ans:real;
sum,anss:int64;
procedure qsort(lx,rx:longint);
var i,j:longint;
m,t:int64;
begin
i:=lx;j:=rx;m:=v[random(rx-lx+1)+lx];
repeat
while (v[i]>m) do inc(i);
while (v[j]<m) do dec(j);
if (i<=j) then
begin
t:=v[i];v[i]:=v[j];v[j]:=t;
inc(i);dec(j);
end;
until (i>j);
if (i<rx) then qsort(i,rx);
if (j>lx) then qsort(lx,j);
end;
function gcd(a,b:longint):longint;
begin
if (b=0) then exit(a);
exit(gcd(b,a mod b));
end;
function calc(i,j:longint):int64;
var ans:int64;
t:array[0..100] of longint;
ii,jj,tt,g:longint;
begin
for ii:=1 to j do
t[ii]:=i-j+ii;
for ii:=1 to j do
begin
tt:=ii;
for jj:=1 to j do
begin
g:=gcd(t[jj],tt);
tt:=tt div g;
t[jj]:=t[jj] div g;
end;
end;
ans:=1;
for ii:=1 to j do
ans:=int64(ans*t[ii]);
exit(ans);
end;
begin
randomize;
readln(n,a,b);
for i:=1 to n do
read(v[i]);
qsort(1,n);
sum:=0;
for i:=1 to a do
sum:=sum+v[i];
ans:=sum/a;
writeln(ans:0:6);
tot1:=0;tot2:=0;
for i:=1 to n do
if (v[i]=v[a]) then inc(tot1);
left:=1;
while (left<=n) and (v[left]<>v[a]) do inc(left);
dec(left);
a:=a-left;b:=b-left;
anss:=0;
if (left=0) then
begin
for i:=a to b do
anss:=anss+calc(tot1,i);
end else anss:=calc(tot1,a);
writeln(anss);
end.