import bisect

n, m, c = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()

ans = 0
for i in range(n):
    ans += m - bisect.bisect_right(b, c//a[i])

print(ans/n/m)