class BinaryIndexedTree: def __init__(self, size): self._data = [0] * size def add(self, i, x): data = self._data i += 1 n = len(data) while i <= n: data[i - 1] += x i += i & -i def _sum(self, stop): data = self._data result = 0 i = stop while i > 0: result += data[i - 1] i -= i & -i return result def range_sum(self, start, stop): return self._sum(stop) - self._sum(start) n = int(input()) r = list(map(int, input().split())) g = list(map(int, input().split())) b = list(map(int, input().split())) rr = [0] * 3001 for i in r: rr[i] += 1 gg = [0] * 3001 for i in g: gg[i] += 1 bb = [0] * 3001 for i in b: bb[i] += 1 gb = [[] for _ in range(3001)] for i in range(1, 3001): x = gg[i] if x == 0: continue for j in range(1, 3001): y = bb[j] if y == 0: continue gb[max(i, j)].append(i << 12 + j) bit = BinaryIndexedTree(6001) result = 0 for i in range(1, 3001): for x in gb[i]: j = x >> 12 k = x & 4095 bit.add(j + k, gg[j] * bb[k]) result += rr[i] * bit.range_sum(i + 1, 6001) print(result)