#include <bits/stdc++.h>

using namespace std;
ifstream f("oite.in");
ofstream g("oite.out");
map <int,int> m;
int mod=666013;
vector <int> a[666012];
int i,j,n,sum[2000000],q,val,v[2000005],sol,poz;
int nr (int val)
{
    int numar=0,i;
    poz=val%mod;
    for (i=0;i<a[poz].size();i++)
    {
        if (a[poz][i]==val)
        {
            numar++;
        }
    }
    return numar;
}
int main()
{
    f>>n>>val;
    for (i=1;i<=n;i++)
    {
        f>>v[i];
    }
    for (i=1;i<=n;i++)
    {
        for (j=i+1;j<=n;j++)
        {
            sol=sol+nr(val-v[i]-v[j]);
        }
        for (j=1;j<i;j++)
        {
            a[(v[i]+v[j])%mod].push_back(v[i]+v[j]);
        }
    }
    g<<sol;
    return 0;
}