#include <stdio.h>
#include <stdlib.h>
#include <vector>
#define MOD 666013
#define list (key % MOD)
#define foreach(G) for(decltype(G.begin()) it = (G).begin(); it != (G).end(); ++it)

using namespace std;

vector <int> Hash[MOD];
int N, L, ans, A[1024];

inline void find(int key){
	if (key < 0) return;
	foreach (Hash[list])
		ans += (*it == key);
}

int main(){
	freopen("oite.in", "r", stdin);
	freopen("oite.out", "w", stdout);

	scanf("%d %d", &N, &L);
	for (int i = 0; i < N; ++i)
		scanf("%d", &A[i]);
	
	for (int i = 0; i < N; ++i){
		for (int j = i + 1; j < N; ++j)
			find(L - A[i] - A[j]);

		for (int j = 0, key; j < i; ++j)
			key = A[i] + A[j],
			Hash[list].push_back(key);
		}

	printf("%d", ans);

	return 0;
}