#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>

#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n;i>=0;--i)
#define REPI(itr,v) for(auto itr=v.begin();itr!=v.end();++itr)
#define REPIR(itr,v) for(auto itr=v.rbegin();itr!=v.rend();++itr)
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define SORT(v,n) sort(v, v+n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(),v.end()
#define llong long long
#define INF 999999999
#define SUR 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair

int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};

using namespace std;

typedef pair<int,int> pii;

int main(){

  llong n, v;
  scanf("%lld %lld", &n, &v);
  vector<llong> a(n), b(n), c(n), d(n);
  REP(i,n){
    scanf("%lld", &a[i]);
  }
  REP(i,n){
    scanf("%lld", &b[i]);
  }
  REP(i,n){
    scanf("%lld", &c[i]);
  }
  REP(i,n){
    scanf("%lld", &d[i]);
  }

  map<llong, int> mp;;
  REP(i,n){
    REP(j,n){
      mp[a[i] + b[j]]++;
    }
  }

  llong ans = 0;
  REP(i,n){
    REP(j,n){
      llong tmp = v - c[i] - d[j];
      if(mp[tmp] > 0){
        ans += mp[tmp];
      }
    }
  }
  printf("%lld\n", ans);
  return 0;
}


