#include <stdio.h>
#include <vector>
#include <list>
#define MAXOI 2000
#define MAXH 6663 

struct grupare {
	int a, b;
	int sum;
};
using namespace std;

int contains(vector<list<struct grupare> > &hash, int x, int a, int b) {
	list<struct grupare>::iterator it;
	int result = 0;
	int mod = x % MAXH;
	for (it = hash[mod].begin(); it != hash[mod].end(); it++) {
		if ((*it).sum == x && (*it).a != a && (*it).b != a &&
				(*it).a != b && (*it).b != b) {
			result ++;
		}
	}
	return result;
}
int main() {
	int C, L;
	int oi[MAXOI];
	
	int result = 0;
	list<int> lst;
	vector<list<int> > hash(MAXH, lst);

	FILE *f = fopen("oite.in", "r");
	FILE *g = fopen("oite.out", "w");

/*	for (int i = 0; i < MAXH; i++) {
		hash.push_back(lst);
	}*/
	fscanf(f, "%d%d", &C, &L);
	for (int i = 0; i < C; i++) {
		fscanf(f, "%d", &oi[i]);
	}

	struct grupare grupa;
	for (int i = 0; i < C; i++) {
		for (int j = i + 1; j < C; j++) {
			hash[grupa.sum % MAXH].push_back(oi[i] + oi[j]);
		}
	}

/*	for (int i = 0; i < C; i++) {
		for (int j = i + 1; j < C; j++) {
			int sum = oi[i] + oi[j];
			result += contains(hash, L - sum, i, j);
		}
	}*/
	fprintf(g, "%d", result/4);

	fclose(f);
	fclose(g);


}