#include<fstream>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<array>
#include<functional>
#include<deque>
#include<math.h>
#include<unordered_set>
#include<queue>
#include<list>
#include<set>
#include<iomanip>
#include<bitset>
using namespace std;
int i, j, k, l,c,v[1050],nr;
unordered_map<int, vector<pair<int,int>>>mp;
unordered_map<int, vector<pair<int, int>>>::iterator it, iter;
vector<pair<int, int>>::iterator its,itd;
unordered_set<int>st;
int main()
{
	//ifstream f("file.in");
	//ofstream g("file.out");
	ifstream f("oite.in");
	ofstream g("oite.out");
	f >> c >> l;
	for (i = 1; i <= c; i++)
		f >> v[i];
	for(i=1;i<=c-1;i++)
		for (j = i + 1; j <= c; j++)
		{
			mp[v[i] + v[j]].push_back({i,j});
		}
	for (it = mp.begin(); it != mp.end(); it++)
	{
		iter = mp.find(l - it->first);
		if (iter != mp.end())
		{
			for(itd=it->second.begin();itd!=it->second.end();itd++)
				for (its = iter->second.begin(); its != iter->second.end(); its++)
				{
					st.clear();
					st.insert(its->first);
					st.insert(its->second);
					st.insert(itd->first);
					st.insert(itd->second);
					if (st.size() == 4)
						nr++;
				}
		}
	}
	g << nr/6;
	return 0;
}