//#include <iostream>
#include <fstream>
#include <unordered_map>
#include <random>
#include <iterator>
#include <algorithm>
using namespace std;
unordered_map <int,int> im,pa;
int v[1050],n,l,suma,var;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
} in ("oite.in");

int main()
{
    ofstream cout("oite.out");
    cin>>n>>l;
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(v[i]+v[j]<=l){
                if(((l-v[i]-v[j])&1)==1){
                    var+=im[l-v[i]-v[j]];
                }
                else
                    var+=pa[l-v[i]-v[j]];
            }
            else
                break;
        }
        for(int j=1;j<i;j++){
            if(v[i]+v[j]<=l){
                if(((v[i]-v[j])&1)==1){
                    im[v[i]+v[j]]++;
                }
                else{
                    pa[v[i]+v[j]]++;
                }
            }
            else
                break;
        }
    }
    cout<<var;
    return 0;
}
//13 1 12 1 12 1