#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll& a, ll b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
bool chmax(ll& a, ll b) {
    if (b > a) {
        a = b;
        return 1;
    }
    return 0;
}
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans, s;
int main() {
    cin >> n >> m;
    vl A, B, C, D, X, Y;
    rep(i, n) {
        cin >> x;
        A.push_back(x);
    }
    rep(i, n) {
        cin >> x;
        B.push_back(x);
    }
    rep(i, n) {
        cin >> x;
        C.push_back(x);
    }
    rep(i, n) {
        cin >> x;
        D.push_back(x);
    }
    rep(i, n) {
        rep(j, n) {
            X.push_back(A[i] + B[j]);
            Y.push_back(C[i] + D[j]);
        }
    }

    sort(all(X));
    sort(all(Y));

    rep(i,X.size()){
        ans += upper_bound(all(Y), m - X[i]) - lower_bound(all(Y), m - X[i]);
    }

    cout << ans << endl;
}

