#include using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; using i128 = __int128_t; using u128 = __uint128_t; using isize = std::ptrdiff_t; using usize = std::size_t; class rep { struct Iter { usize itr; constexpr Iter(const usize pos) noexcept : itr(pos) {} constexpr void operator++() noexcept { ++itr; } constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; } constexpr usize operator*() const noexcept { return itr; } }; const Iter first, last; public: explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {} constexpr Iter begin() const noexcept { return first; } constexpr Iter end() const noexcept { return last; } }; template using Vec = std::vector; void main_() { usize N; std::cin >> N; // max(g_j, b_k) <= r_i // r_i < g_j + b_k std::array R{}, G{}, B{}; for (const auto i : rep(0, N)) { u32 x; std::cin >> x; R[x] += 1; } for (const auto i : rep(0, N)) { u32 x; std::cin >> x; G[x] += 1; } for (const auto i : rep(0, N)) { u32 x; std::cin >> x; B[x] += 1; } for (const auto i : rep(0, 3 * 1000)) { R[i + 1] += R[i]; } u64 ans = 0; for (const auto j : rep(1, 3 * 1000 + 1)) { for (const auto k : rep(1, 3 * 1000 + 1)) { ans += (u64)B[j] * G[k] * (R[std::min(j + k - 1, (usize)(3 * 1000))] - R[std::max(j, k) - 1]); } } std::cout << ans << '\n'; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); main_(); return 0; }