#include<fstream>
#include<unordered_map>
#include<utility>
#include<vector>
#include<iostream>
using namespace std;

unordered_map<int, vector<pair<int, int> > > h; 
int oite[1024];

ifstream fin("oite.in");
ofstream fout("oite.out");

int main() {
	int n, l, i, j, sol = 0;
	fin >> n >> l;
	for(i = 0; i < n; i++) {
		fin >> oite[i];
	}
	// insereaza in hash toate perechile de numere; cheia = suma lor
	for(i = 0; i < n; i++) {
		for(j = i + 1; j < n; j++) {
			if(h.find(oite[i] + oite[j]) == h.end()) {
				vector<pair<int, int>> v;
				v.push_back(make_pair(i, j));
				h.insert(make_pair(oite[i] + oite[j], v));
			} else {
				h[oite[i] + oite[j]].push_back(make_pair(i, j));
			}
		}
	}
	// pt fiecare pereche de numere, cauta in hash l - suma lor si verifica
	// daca numerele sunt diferite
	vector<pair<int, int>> v;
	for(i = 0; i < n; i++) {
		for(j = i + 1; j < n; j++) {
			if(h.find(l-oite[i]-oite[j]) != h.end()) {
				for(vector<pair<int, int>>::iterator p = h[l-oite[i]-oite[j]].begin(); p != h[l-oite[i]-oite[j]].end(); ++p) {
					if(i != p->first && i != p->second && j != p->first && j != p->second) {
						sol++;
					//	cout << i << " " << j << " " << p->first << " " << p->second << endl;
					}
				}
			}
		}
	}
	fout << sol / 6 << "\n";
	return 0;
}