#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int n;
    cin >> n;
    vi r(n), g(n), b(n);
    rep(i, n) cin >> r[i];
    rep(i, n) cin >> g[i];
    rep(i, n) cin >> b[i];
    vc<int> g_sum(3030, 0), b_sum(3030);
    rep(i, n) {
        g_sum[g[i]]++;
        b_sum[b[i]]++;
    }
    int gmax = *max_element(ALL(g));
    rep(i, 3005) {
        g_sum[i + 1] += g_sum[i];
        b_sum[i + 1] += b_sum[i];
        // cout << i + 1 << " " << g_sum[i + 1] << " " << b_sum[i + 1] << endl;
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 1; j <= min(r[i] - 1, gmax); j++) {
            auto d = upper_bound(ALL(b_sum), r[i] - j) - b_sum.begin();
            int tmp = (g_sum[3004] - g_sum[j - 1]) * (b_sum[3004] - b_sum[d]);
            cout << tmp << endl;
            ans += tmp;
        }
    }
    cout << ans << endl;
}