#include<fstream>
#include<vector>
#define mod 666013
using namespace std;

int i,j,n,a[1025],x,nrsol=0;
unsigned long l;
vector<unsigned long>  hash[mod+2];
void cauta(unsigned long x)
{
    int i,nod=x%mod;
    for(i=0;i<hash[nod].size();++i)
    if(hash[nod][i]==x)
    ++nrsol;
}
int main()
{
    ifstream f("oite.in");
    ofstream g("oite.out");
    f>>n>>l;
    for(i=1;i<=n;++i)
    f>>a[i];
    for(i=1;i<n;++i)
    {
        for(j=i+1;j<=n;++j)
        if(l-a[i]-a[j]>=0)
        cauta(l-a[i]-a[j]);
        for(j=1;j<i;++j)
        {
            x=(a[i]+a[j])%mod;
            hash[x].push_back(a[i]+a[j]);
        }
    }
    g<<nrsol<<"\n";
    return 0;
}