#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;

using ll = long long;
using vi = vector<ll>;
using cd = complex<double>;
const double PI = acos(-1);

void fft(vector<cd> &a, bool inv) {
    int n = a.size();
    for (int i = 1, j = 0, bit; i < n; i++) {
        for (bit = n/2; j & bit; bit /=2 ) j ^= bit;
        j += bit;
        if (i < j) swap(a[i], a[j]);
    }
    for (int len = 2; len <= n; len *= 2) {
        double ang = 2 * PI / len * (inv ? -1 : 1);
        cd wlen(cos(ang), sin(ang));
        for (int i = 0; i < n; i += len) {
            cd w(1);
            for (int j = 0; j < len/2; j++) {
                cd u = a[i+j], v = a[i+j+len/2] * w;
                a[i+j] = u+v, a[i+j+len/2] = u-v;
                w *= wlen;
            }
        }
    }
    if (inv) for (cd &x : a) x /= n;
}

vi conv(vi const &a, vi const &b) {
    vector<cd> fa(all(a)), fb(all(b));
    int n = 1;
    while (n < a.size() + b.size()) n *= 2;
    fa.resize(n), fb.resize(n), fft(fa, 0), fft(fb, 0);
    for (int i = 0; i < n; i++) fa[i] *= fb[i];
    fft(fa, 1);
    
    vi r(n);
    for (int i = 0; i < n; ++i) r[i] = round(fa[i].real());
    return r;
}

const ll N = 5e4+3, X = 6e4+3;
ll n[3];
vi a[3];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    for (int i = 0; i < 3; ++i) {
        cin >> n[i];
        a[i].resize(X);
        for (int j = 0; j < n[i]; ++j) {
            int x; cin >> x;
            a[i][x+30000] = 1;
        }
    }
    auto r = conv(a[0], a[2]);
    ll ans = 0;
    for (int j = 0; 2*j < X; ++j) {
        if (a[1][j]) {
            if (r[2*j]) {
                ans += r[2*j];
            }
        }
    }
    
    cout << ans;
}