Problem:
Coin Combination 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.

Sample Input 1

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

Sample Output 1

9

Sample Input 2

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

Sample Output 2

625

Solution in C++14 (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
	int n, v;
	std::cin >> n >> v;
	std::vector<long long int> a(n), b(n), c(n), d(n);
	for (auto &n : a) std::cin >> n;
	for (auto &n : b) std::cin >> n;
	for (auto &n : c)std::cin >> n;
	for (auto &n : d) std::cin >> n;
	std::vector<long long int> ab(n * n), cd(n * n);
	for (auto i = 0; i < n; ++i) {
		for (auto j = 0; j < n; ++j) {
			ab[i * n + j] = a[i] + b[j];
			cd[i * n + j] = c[i] + d[j];
		}
	}
	std::sort(cd.begin(), cd.end());
	long long int sum = 0;
	for (const auto n : ab) {
		sum += std::upper_bound(cd.begin(), cd.end(), v - n) - std::lower_bound(cd.begin(), cd.end(), v - n);
	}
	std::cout << sum << std::endl;
}