using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cstdlib>
#include <utility>
#include <algorithm>
#include <functional>

#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(ui i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define C(v) memset((v),0,sizeof((v)))
#define CP(x,y) memcpy((x),(y),sizeof((y)))
#define FORit(it,v) for(it = (v).begin();it != (v).end();++it)
#define mp make_pair

#define IN  "oite.in"
#define OUT "oite.out"
#define N_MAX 1<<10
#define ui unsigned int

vector< pair<ui,ui> > A(1<<20),B(1<<20);
char buffer[1<<20];
ui V[N_MAX];
ui rez,M,K,S,N;

II void read(ui &aux)
{
	aux = 0;
	for(;buffer[K] < '0' || buffer[K] > '9';++K);
	for(;buffer[K] >= '0' && buffer[K] <= '9';++K)
		aux = aux * 10 + buffer[K] - '0';
}

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	fread(buffer,1,1<<20,stdin);
	fclose(stdin);
	read(N);
	read(S);
	FOR(i,1,N)
		read(V[i]);
}

II void make(int x,int y)
{
	ui j=y,a(0),b(0);
	
	for(ui i=x;i < M && A[i].f == A[x].f;++a,++i);
	for(ui i=y;i < M && B[i].f == B[y].f;++b,++i);
	
	FOR(i,x,x+a-1)
	{
		for(;B[j].s <= A[i].s && j <= y+b-1;++j);
		if(A[i].s < B[j].s)
			rez += y+b-j;
	}
}

II void solve()
{
	FOR(i,1,N-1)
	FOR(j,i+1,N)
	{
		++M;
		A[M] = mp(V[i] + V[j],j);
		B[M] = mp(V[i] + V[j],2000 - i);
	}	
	A.resize(M+1);
	B.resize(M+1);
	sort(A.begin()+1,A.end());
	sort(B.rbegin(),B.rend()-1);
	FOR(i,1,M)
		B[i].s = 2000 - B[i].s;
/*	
	FOR(i,1,M)
	{
		printf("%d %d\n",A[i].f,A[i].s);
	}
	printf("\n\n");
	FOR(i,1,M)
	{
		printf("%d %d\n",B[i].f,B[i].s);	
	}
*/
	ui y(1);
	
	FOR(x,1,M)
	{	
		for(;A[x].f + B[y].f > S && y<=M;++y);
		if(A[x].f + B[y].f == S)
			make(x,y);
		for(;A[x].f == A[x+1].f && x<M;++x);
	}	
	
	printf("%d\n",rez);
}

int main()
{
	scan();
	solve();
	return 0;
}