Problem: You have 4 bags A, B, C and D each of which includes N coins (there are totally 4N coins). Values of the coins in each bag are ai, bi, ci and di respectively.

Find the number of combinations that result when you choose one coin from each bag (totally 4 coins) in such a way that the total value of the coins is V. You should distinguish the coins in a bag.

Constraints

* 1 ≤ N ≤ 1000
* 1 ≤ ai, bi, ci, di ≤ 1016
* 1 ≤ V ≤ 1016
* All input values are given in integers

Input

The input is given in the following format.


N V
a1 a2 ... aN
b1 b2 ... bN
c1 c2 ... cN
d1 d2 ... dN


Output

Print the number of combinations in a line.

Examples

Input

3 14
3 1 2
4 8 2
1 2 3
7 3 2


Output

9


Input

5 4
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1


Output

625

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846   // pi

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;

#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)

static const ll INF = 1e15;

const ll mod = 1000000007;

int main(void)
{
	ll n, v;
	cin >> n >> v;
	vector<ll> vs[4];
	rep(i,4){
		rep(j, n) {
			ll a; cin >> a;
			vs[i].push_back(a);
		}
	}
	unordered_map<ll, ll> ms[2];
	rep(i, 2) {
		ll a = i * 2;
		ll b = a + 1;
		rep (j, n) {
			rep(k, n) {
				ms[i][vs[a][j] + vs[b][k]]++;
			}
		}
	}
	ll sum = 0;
	for (auto p : ms[0]) {
		ll t = v - p.first;
		sum += p.second * ms[1][t];
	}
	cout << sum << endl;
	return 0;
}