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

int A[1031];
int N;
int L;
int nr = 0;

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]);
	sort(A+1,A+N+1);
	for(int i=1;i<=N;i++)
		for(int j=i+1;j<=N && A[i] + A[j]<L;j++)
			for(int k=j+1;k<=N && A[i] + A[j] + A[k]<L;k++)
				for(int l=k+1;l<=N && A[i] + A[j] + A[k] + A[l] <=L;l++)
					if(A[i] + A[j] + A[k] + A[l] == L)
						nr ++;
	fprintf(g,"%d ",nr);
	
	fclose(g);
	fclose(f);
	return 0;
}