def binary_search(a, n, k, lower)
	left = 0
	right = n
	while left < right do
		mid = (left + right) / 2
		if lower ? a[mid] < k : a[mid] <= k then
			left = mid + 1
		else
			right = mid
		end
	end
	return right
end

n = gets.to_i
r = gets.split(" ").map{|s| s.to_i}.sort
g = gets.split(" ").map{|s| s.to_i}.sort
b = gets.split(" ").map{|s| s.to_i}.sort

cnt = 0
i = 0
while i < n do
	a = r[i]
	j = binary_search(r, n, a, false)
	an = j - i
	k = binary_search(g, n, a, false)
	l = 0
	while l < k do
		m = binary_search(g, n, g[l], false)
		bn = m - l
		o = binary_search(b, n, a, false)
		p = binary_search(b, n, a - g[l] + 1, true)
		cn = o - p
		cnt += an * bn * cn
		l = m
	end
	i = j
end

puts cnt