#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string.h>
using namespace std;
const int mod=7919;
struct oita {
	int val;
	short a,b;
};
vector <oita> v[mod];
int a[1025];
inline short verifica(vector <oita>::iterator it, oita x)
{
	if((it->val==x.val)&&(it->a!=x.a)&&(it->a!=x.b)&&(it->b!=x.a)&&(it->b!=x.b))
		return 1;
	return 0;
}
inline int cauta(oita x)
{
	int k,s;
	k=x.val%mod;
	s=0;
	for(vector <oita>::iterator it=v[k].begin();it!=v[k].end();it++) {
		if(verifica(it,x)==1) 
			s++;
	}
	return s;
}
inline void adauga(oita x)
{
	v[x.val%mod].push_back(x);
}
int main ()
{
	int s,nr;
	short i,j,n;
	oita x;
	ifstream f("oite.in");
	ofstream g("oite.out");
	f>>n>>s;
	for(i=1;i<=n;i++)
		f>>a[i];
	f.close();
	sort(a+1,a+n+1);
	for(i=1;i<=n-1;i++)
		for(j=i+1;j<=n;j++) 
			if((a[i]+a[j])<=s) {
				x.val=a[i]+a[j];
				x.a=i;
				x.b=j;
				adauga(x);
			}
	nr=0;
	for(i=1;i<=n-1;i++)
		for(j=i+1;j<=n;j++) {
			x.val=s-(a[i]+a[j]);
			if(x.val>=0) {
				x.a=i;
				x.b=j;
				nr=nr+cauta(x);
			}
		}
	g<<nr/6;
	g.close();
	return 0;
}