#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int n,i,j,k,v[1100],l,ok,coun,po;
const int maxp=9013;
vector<int> h[maxp],hx[maxp];
int main()
{
    freopen("oite.in","r",stdin);
    freopen("oite.out","w",stdout);
    scanf("%d%d",&n,&l);
    for(i=1;i<=n;++i)
        scanf("%d",&v[i]);
    sort(v+1,v+n+1);
    for(i=1;i<n;++i)
        for(j=i+1;j<=n;++j)
        {
            po=(v[i]+v[j])%maxp;
            h[po].push_back((v[i]+v[j]));
            hx[po].push_back(i);
        }
    for(i=1;i<n&&v[i]+v[1]<l/2;++i)
        for(j=i+1;j<=n&&v[j]+v[i]<l/2;++j)
        {
            if(l>v[i]+v[j])
            {
                ok=(l-v[i]-v[j])%maxp;
                    for(k=0;k<h[ok].size();++k)
                        if(j<hx[ok][k]&&h[ok][k]+v[i]+v[j]==l)
                        ++coun;
            }
        }
   printf("%d",coun);
    return 0;
}