#include<stdio.h>
#include<algorithm>
#include<malloc.h>
using namespace std;

#define M 3031

typedef struct _nod
{
	int info;
	int a;
	int b;
	struct _nod *adr;
} nod;

typedef struct
{
	struct _nod *cap;
} list;

typedef struct
{
	int info;
	int a;
	int b;
} nr2;

int A[1031];
nr2 B[1031*1031];
list H[M+3];
int N;
int L;
int nr = 0;
int nr1;

int h(int r)
{	return r%M;	}

int cmp(nr2 a,nr2 b)
{
	return a.info<b.info;
}

bool distinct(int a,int b,int c,int d)
{
	if(a == b || a == c || a == d || b == c || b == d || c == d)
		return false;
	return true;
}

int add2(int a,int b,int r)
{
	nod *q = H[h(r)].cap;
	nod *nou = (nod*)malloc(sizeof(nod));
	nou->info = r;
	nou->a = a;
	nou->b = b;
	nou->adr = H[h(r)].cap;
	H[h(r)].cap = nou;
}

int search(int a,int b,int r)
{
	int nr = 0;
	nod *q = H[h(r)].cap;
	while(q)
	{
		if(q->info == r)
			if(distinct(a,b,q->a,q->b))
				nr ++;
		q = q->adr;
	}
	return nr;
}

int main()
{
	FILE *f = fopen("oite.in","r");
	FILE *g = fopen("oite.out","w");
	
	fscanf(f,"%d %d",&N,&L);
	for(int i=1;i<=N;i++)
		fscanf(f,"%d ",&A[i]);
	for(int i=1;i<=N;i++)
		for(int j=i+1;j<=N;j++)
		{
			add2(i,j,A[i]+A[j]);
			B[++nr1].info  = A[i]+A[j];
			B[nr1].a = i;
			B[nr1].b = j;
		}
//	sort(B+1,B+nr1+1,cmp);
	for(int i=1;i<=nr1;i++)
			nr += search(B[i].a,B[i].b,L-B[i].info);
	fprintf(g,"%d ",nr/6);
	
	fclose(g);
	fclose(f);
	return 0;
}