#include <fstream>

using namespace std;

const int K = 666019;
const int Nmax = 1024 + 1;

int a[Nmax], val[Nmax], urm[Nmax], lst[K], nr;

bool exista(int x)
{
    int categoria = x % K;
    int p = lst[categoria];
    while (p != 0)
    {
        if (val[p] == x)
        {
            return true;
        }
        p = urm[p];
    }
    return false;
}

void adauga(int x)
{
    if (exista(x))
    {
        return;
    }
    val[++nr] = x;
    int categoria = x % K;
    urm[nr] = lst[categoria];
    lst[categoria] = nr;
}

int main()
{
    ifstream fin("oite.in");
    ofstream fout("oite.out");
    int c, l;
    fin >> c >> l;
    for (int i = 0; i < c; i++)
    {
        fin >> a[i];
    }
    for (int i = 0; i < c; i++)
    {
        for (int j = 0; j < c; j++)
        {
            adauga(a[i] + a[j]);
        }
    }
    long long ans = 0;
    for (int i = 0; i < c; i++)
    {
        for (int j = 0; j < c; j++)
        {
            if (i != j && a[i] + a[j] <= l)
            {
                if (exista(l - a[i] - a[j]))
                {
                    for (int p = 0; p < c; p++)
                    {
                        for (int w = 0; w < c; w++)
                        {
                            if (p != i && p != j && p != w && w != i && w != j)
                            {
                                if (a[i] + a[j] + a[p] + a[w] == l)
                                {
                                    ans++;
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    fout << ans / 24;
    return 0;
}