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