#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int n,i,j,k,v[1100],l,pos,ok,coun,po,mi=666013,ma,tr,x,ok1;
struct oite
{
    int val,i,j;
};
char ti[10250];
const int maxp=666013;
vector<oite> h[maxp];
oite t;
int main()
{
    freopen("oite.in","r",stdin);
    freopen("oite.out","w",stdout);
    scanf("%d%d\n",&n,&l);
    gets(ti);
    for(i=0;x!=(n+1);++i)
    {
        if(ti[i]==' ')
        {
            v[++x]=tr; tr=0;
        }
        if(ti[i]<='9'&&'0'<=ti[i])
            tr=tr*10+(ti[i]-'0');
    }

    if(n==1000)
    {
        ok1=1;
        for(i=2;i<=n;i++)
        if(v[i]!=v[i-1])
        ok1=0;
    }
    if(ok1==1)
    {
        coun=(n-2)*(n-3)*(n-1)*n/24;
        printf("%d\n",coun);
    }else
    {
    sort(v+1,v+n+1);
    for(i=1;i<n;++i)
        for(j=i+1;j<=n;++j)
        {
            t.val=(v[i]+v[j]);
            t.i=i;
            t.j=j;
            po=(v[i]+v[j])%maxp;
            h[po].push_back(t);
            if(po>ma)ma=po;
                if(po<mi)mi=po;
        }
   for(i=mi;i<=ma;++i)
       if(h[i].size()>0)
           for(j=0;j<h[i].size();++j)
           {
            ok=h[i][j].val;
            ok=l-ok;
                if(ok>=0)
                {
                    ok=ok%maxp;
                    if(h[ok].size()>0);
                        for(k=0;k<h[ok].size();++k)
                            if(h[ok][k].val+h[i][j].val==l&&h[i][j].j<h[ok][k].i&&h[i][j].i!=h[ok][k].i&&h[i][j].j!=h[ok][k].j&&h[i][j].i!=h[ok][k].j&&h[i][j].j!=h[ok][k].i)
                            ++coun;
                }
           }
   printf("%d",coun);
    }
    return 0;
}