using namespace std;
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <string>
#define r 17
const int maxn =366713;
const int mod=566703;
#define ui unsigned int
struct nod { short i, j;};//__attribute__((packed));

nod H[maxn][17];
int len[maxn];
short n;
ui S;
ui x[1024];
ui nr;
inline void insert(short i, short j)
{
	nod t;
	t.i=i; t.j=j;
	
	ui h=((x[i]+x[j]))%maxn;
	//H[h]=(nod*) realloc(H[h], sizeof(nod)*(len[h]+2));
	H[h][len[h]++]=t;
//	t->next=H[h];
	//H[h]=t;
}

inline void find(short i, short j)
{
	ui  sum=S-(x[i]+x[j]);
	ui h=((sum))%maxn;
	ui ii, jj;
	for(int t=0;t<len[h];++t)
	{
		ii=H[h][t].i;
		jj=H[h][t].j;
		if(x[ii]+x[jj]==sum)
			if(ii==i || ii==j || jj==i || jj==j);
			else ++nr;
	}
	/*
	for(t=H[h];t;t=t->next)
		if(t->sum==sum)
		
			if(t->i==i || t->i==j || t->j==i || t->j==j);
			else //{ printf("%d %d %d %d\n",i, j, t->i, t->j);++nr;}
			++nr;
		
	*/

}

int main()
{
	freopen("oite.in","r",stdin);
	scanf("%d %d\n", &n, &S);
	short i, j;
	//	init();
	
	ui h;
	for(i=1;i<=n;++i) scanf("%d ", x+i);
	
	for(i=1;i<n;++i)
		for(j=i+1;j<=n;++j)
			insert(i,j);
		
	

	ui sum;
	for(i=1;i<n;++i)
		for(j=i+1;j<=n;++j)
			find(i, j);
		
	freopen("oite.out","w",stdout);
	printf("%d\n", nr/6);
	return 0;
}