#include<cstdio>
#include<vector>
#include<algorithm>
#define infile "oite.in"
#define outfile "oite.out"
#define MOD 666013
#define pb push_back
#define ll int
#define n_max 1030
#define FOR(g) \
   for(vector < hash > ::iterator it = g.begin(); it!=g.end(); ++it)
using namespace std;

struct hash {
	int a, b;
	ll s;
};
	
vector < hash > T[MOD];

ll v[n_max], L;

int N;

ll Sol;


inline int h(ll x){
	return  x % MOD;}



void citeste()
{
	freopen(infile,"r",stdin);
	
    scanf("%d %d",&N, &L);
	
	for(int i=1; i <= N; ++i)
		scanf("%d",&v[i]);
	
	fclose(stdin);
}


inline int order(const int &a, const int &b, const int &c, const int &d)
{
	if(a != c && a != d && b != c && b != d && c < a && a < d && b < d)
		return 1;
	
	return 0;
}



void rezolva()
{
	sort(v+1, v+N+1);
	
	hash r;
	ll part_sum;
	
	for(int i=1; i<=N; ++i)
		for(int j=i+1; j<=N; ++j)
			if(v[i] + v[j] <= L)
			{
				r.a = i;
				r.b = j;
				r.s = v[i] + v[j];
				
				T[h(r.s)].pb(r);
				
				part_sum = L - r.s;
				FOR(T[h(part_sum)])
					if((*it).s == part_sum)
						if(order(i, j, (*it).a, (*it).b))
							Sol++;
			}	
}


void afiseaza()
{
	freopen(outfile,"w",stdout);
	
	printf("%d\n",Sol);	
	
	fclose(stdout);
}


int main()
{
	citeste();
	rezolva();
	afiseaza();	
	
	return 0;
}