from bisect import bisect_right, bisect_left

n = int(input())
R = list(map(int, input().split()))
G = list(map(int, input().split()))
B = list(map(int, input().split()))
R.sort()
G.sort()
B.sort()
ans = 0
for i in range(n):
    r = R[i]
    j = bisect_left(G, r)
    k = bisect_right(B, r - G[max(0, j - 1)])
    # print(r, j, k)
    ans += max(0, j - i + 1) * max(0, n - k + 1)
print(ans)