#include <cstdio>
#include <vector>
#include <algorithm>
#define mod 3033
using namespace std;
vector <int> x[mod];
int v[1030];
vector <int> :: iterator it;
int main()
{
    freopen("oite.in","r",stdin);
    freopen("oite.out","w",stdout);
    int n,c,k,i,j,sol=0;
    scanf("%d%d",&n,&c);

    for(i=1;i<=n;i++) scanf("%d",&v[i]);
    sort(v+1,v+n+1);
    for(i=3;i<=n-1;i++)
    {
        for(j=i+1;j<=n;j++)
        {
            k=v[i]+v[j];

                x[k%mod].push_back(k);

        }
    }
    for(i=2;i<=n-2;i++)
    {
        for(j=1;j<i;j++)
        {
            if(x[(c-v[i]-v[j])%mod].size()!=0)
            {
                sol+=x[(c-v[i]-v[j])%mod].size();
            }
        }
        for(j=i+2;j<=n;j++)
        {
            if(x[(v[i+1]+v[j])%mod].size()!=0)
            {
                x[(v[i+1]+v[j])%mod].pop_back();
            }
        }
    }
    printf("%d",sol);
}