#include<cstdio>
#include<vector>
#include<cassert>

using namespace std;

typedef long long int lld;
typedef pair<int,int> PII;
typedef pair<lld,PII> Elm;
const int MOD = 666013;
const int NMAX = 1030;

bool Diferit(PII x,PII y)
{
    return x.second<y.first;
}

struct Hash
{
    vector<Elm> H[MOD+10];

    void Adauga(lld x,int i,int j)
    {
        int r=x%MOD;
        H[r].push_back(make_pair(x,make_pair(i,j)));
    }

    int Cauta(lld x,int i,int j)
    {
        if(x<0) return 0;
        int r=x%MOD,ans=0;
        vector<Elm>::iterator it;
        for(it=H[r].begin(); it!=H[r].end(); it++)
            if(it->first==x && Diferit(it->second,make_pair(i,j))) ans++;
        return ans;
    }
};

int N,Sol;
lld A[NMAX],L;
Hash H;

int main()
{
    int i,j;

    freopen("oite.in","r",stdin);
    freopen("oite.out","w",stdout);

    scanf("%d%lld",&N,&L);

    for(i=1; i<=N; i++)
        scanf("%lld",&A[i]);

    for(i=1; i<=N; i++)
        for(j=i+1; j<=N; j++)
        {
            H.Adauga(A[i]+A[j],i,j);
            Sol+=H.Cauta(L-A[i]-A[j],i,j);
        }

    printf("%d\n",Sol);

    return 0;
}