#include <bits/stdc++.h>

using namespace std;

ifstream fin ("oite.in");
ofstream fout ("oite.out");

const int N = 1030, mod = 666013;
int n, a[N], ans, m;

struct oaie
{
    int x;
    int st;
    int cnt;
};
vector <oaie> H[mod + 1];

void Insert(int val, int i)
{
    int key = val % mod;

    for (int ind = 0; ind < H[key].size(); ind++)
    {
        if (val == H[key][ind].x && i == H[key][ind].st)
        {
            H[key][ind].cnt++;
            return;
        }
    }

    H[key].push_back({val, i, 1});
}

void findHash(int val, int j)
{
    int key = val % mod;

    for (int ind = 0; ind < H[key].size(); ind++)
    {
        if (val == H[key][ind].x && j < H[key][ind].st)
            ans += H[key][ind].cnt;
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> a[i];

    for (int i = 1; i < n; i++)
        for (int j = i + 1; j <= n; j++)
            if(a[i] + a[j] <= m)
                Insert(a[i] + a[j], i);

    for (int i = 1; i < n; i++)
        for (int j = i + 1; j <= n; j++)
            if (m - (a[i] + a[j]))
                findHash(m - (a[i] + a[j]), j);

    fout << ans;
    return 0;
}