#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxa = 6e4;

inline void solve() {
    vector<vector<int>> a(3);
    for (auto &i : a) {
        int n;
        cin >> n;

        i.resize(n);
        for (int &j : i)
            cin >> j;
    }

    bitset<mxa + 1> bst[2];
    for (int &i : a[0])
        bst[0][i + mxa / 2] = 1;
    for (int &i : a[2])
        bst[1][mxa - (i + mxa / 2)] = 1;

    ll ans = 0;
    for (int &i : a[1]) {
        i += mxa / 2;
        i *= 2;
        if (i <= mxa) {
            int sft = mxa - i;
            ans += (bst[0] & (bst[1] >> sft)).count();
        }
        else {
            int sft = i - mxa;
            ans += (bst[0] & (bst[1] << sft)).count();
        }
    }

    cout << ans << '\n';
    return;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;

    while (t--)
        solve();
    return 0;
}