#include<stdio.h> 
#include<math.h>
#include<stdlib.h> 
 
 
struct point 
{ 
    
int inf,s1,s2,s3; 
    
point *leg; 
}; 
 
 
point *qq,*p,*s[10000000]; 
int max,qqq,y,i,j,k,n,a[1029],sum; 
long long nr;
 
 
void verif(int q,int y) 
{  
	qq=s[q%(y+1)];   
    
	while (qq!=NULL)    
	{ 
		if (qq->inf==q); 
				if (qq->s1!=s[i]->s1&&qq->s1!=s[i]->s2&&qq->s2!=s[i]->s1&&qq->s2!=s[i]->s2)
										nr++; 
						
	qq=qq->leg;     
	}
}
 
void hash(int x,int y) 
{
	//if (x>max) max=x;
	
	p=new point; 
	p->inf=x;     

	p->s1=i;
	p->s2=j;
    
	p->leg=s[x%(y+1)];      
	s[x%(y+1)]=p; 
} 

int comp(const void *a1,const void *b1)
{
	int *x=(int*)a1;
	int *y=(int*)b1;
	
	if (*x>*y) return 1;
		else return -1;
}
 
 
int main() 
{ 
	freopen("oite.in","r",stdin); 
	freopen("oite.out","w",stdout); 
	
	max=0;
	scanf("%d%d",&n,&sum); 
	
	for (i=1;i<=n;i++) 
			scanf("%d",&a[i]); 
	
	qsort(a,n,sizeof(int),comp);
	
 
	for (i=1;i<=n-1;i++) 
		for (j=i+1;j<=n;j++) 
			if (a[i]+a[j]<sum) hash(a[i]+a[j],((a[i]+a[j])%676513));
		
 
     
for (i=0;i<=700000;i++) 
        
	while (s[i]!=NULL) 
        
{        
			if (sum-s[i]->inf>0) verif(sum-s[i]->inf,(sum-s[i]->inf)%676513);           
			s[i]=s[i]->leg;         
		}          

	
printf("%lld",nr/3);  

return 0; 
}