#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int n,i,j,k,v[1100],l,pos,ok,coun,po,mi=2000000001,ma;
struct oite
{
    int val,i,j;
};
const int maxp=666013;
vector<oite> h[maxp];
vector<int> a;
oite t;
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)
        {
            t.val=(v[i]+v[j]);
            t.i=i;
            t.j=j;
            if((h[v[i]+v[j]].size()>0&&(v[i]+v[j])!=h[v[i]+v[j]][h[v[i]+v[j]].size()-1].val)||h[v[i]+v[j]].size()==0)
            a.push_back(v[i]+v[j]);
            h[(v[i]+v[j])%maxp].push_back(t);
        }
   for(i=0;i<a.size();++i)
       if(h[a[i]].size()>0)
           for(j=0;j<h[a[i]].size();++j)
           {
            ok=h[a[i]][j].val;
            ok=l-ok;if(ok>=0)ok=ok%maxp;
            if(ok>=0)
                if(h[ok].size()>0)
                    for(k=0;k<h[ok].size();++k)
                        if(h[ok][k].val+h[a[i]][j].val==l&&h[a[i]][j].j<h[ok][k].i&&h[a[i]][j].i!=h[ok][k].i&&h[a[i]][j].j!=h[ok][k].j&&h[a[i]][j].i!=h[ok][k].j&&h[a[i]][j].j!=h[ok][k].i)
                        ++coun;
           }
   printf("%d",coun);
    return 0;
}