#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 1024
#define FIN "oite.in"
#define FOUT "oite.out"
#define mp make_pair
#define f first
#define s second

int N, L, A[MAX_N], nv, Res;
pair<int, pair<short, short> > V[MAX_N*MAX_N];

int main(void)
{
    int i, j, k;

    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%d %d", &N, &L);
    for (i = 0; i < N; i++) scanf("%d", A+i);

    sort(A, A+N);
    for (i = 0; i < N; i++)
        for (j = i+1; j < N && A[i]+A[j] <= L; j++)
            V[nv++] = mp(A[i]+A[j], mp(i, j));

    sort(V, V+nv);
    for (i = 0, j = nv-1; i < j; i++)
    {
        for (; i < j && V[i].f+V[j].f > L; j--);
        for (k = j; k > i && V[i].f+V[k].f == L; k--)
            if (V[i].s.f != V[k].s.f && V[i].s.f != V[k].s.s &&
                V[i].s.s != V[k].s.f && V[i].s.s != V[k].s.s) Res++;
    }

    printf("%d\n", Res/3);

    return 0;
}