import bisect as B
def M():return map(int,input().split())
C,L=0,list
n,m,c=M()
a=L(M())
b=sorted(L(M()))
for i in a:C+=m-B.bisect_right(b,c//i)
print(C/n/m)