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