#include<stdio.h>
#include<unordered_map>
#include<utility>
#include<vector>
#define MAX_TERMS 4
#define MAXL 1000000
#define MAXN 1024
#define MOD 1000007
FILE*fin,*fout;

void bkt(int level);
void Adauga(int _lista,std::pair<int,int> _val);
int N,L;
long long ans;
int v[MAXN+1];
int sol[MAX_TERMS+1];
//std::unordered_map<int,std::vector<std::pair<int,int> > > mp;
int ult=0;
int lista[MOD+1],next[MOD+1];
std::pair<int,int> val[MOD+1];
int k=0;
///heavy computing...

int main()
{
    fin=fopen("oite.in","r");
    fout=fopen("oite.out","w");

    fscanf(fin,"%d%d",&N,&L);

    for(int i=1; i<=N; i++)
    {
        fscanf(fin,"%d",&v[i]);
    }
    for(int i=1; i<=N; i++)
    {
        for(int j=i+1; j<=N; j++)
        {
            if(v[i]+v[j]<=L)
            {
                int sum = v[i] + v[j];
                sum %= MOD;
                Adauga(sum,std::make_pair(i,j));
            }
        }
    }

    for(int i=1; i<=N; i++)
    {
        for(int j=i+1; j<=N; j++)
        {
            if(v[i]+v[j]<=L)
            {
                int reqsum = (L-v[i]-v[j]) % MOD;
                int ptr=lista[reqsum];
                while(ptr)
                {
                    std::pair<int,int>* it=&val[ptr];
                    if(i!=(it->first) && j!=(it->first) && i!=(it->second) && j!=(it->second))
                    {
                        if (v[it->first] + v[it->second] == L - v[i] - v[j]) //Sanity Check
                            ans++;
                    }
                    ptr=next[ptr];
                }
            }
        }
    }
    fprintf(fout,"%lld",ans/6);
    fclose(fin);
    fclose(fout);

    return 0;
}

void bkt(int level)
{
    if(level==MAX_TERMS+1)
    {
        long long sum=0;
        for(int i=1; i<=MAX_TERMS; i++)
        {
            sum+=v[sol[i]];
        }
        if(sum==L)
        {
            ans++;
        }
    }
    else
    {
        for(int i=sol[level-1]+1; i<=N-MAX_TERMS+level; i++)
        {
            sol[level]=i;
            bkt(level+1);
        }
    }
}

void Adauga(int _lista,std::pair<int,int> _val)
{
    next[++k]=lista[_lista];
    val[k]=_val;
    lista[_lista]=k;

}