#include <bits/stdc++.h>

using namespace std;

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

const int N = 1030, mod = 2000003;
int n, a[N], ans, m;
vector < tuple<int, int, int> > H[mod + 1];

void findHash(int val, int i, int j)
{
    if (val < 0)
        return;

    int key = val % mod;

    for (unsigned ind = 0; ind < H[key].size(); ind++)
    {
        int x = get<0>(H[key][ind]);
        int k = get<1>(H[key][ind]);
        int t = get<2>(H[key][ind]);

        if (x == val && k > j)
            ans++;
    }

}

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++)
            H[(a[i] + a[j]) % mod].push_back(make_tuple(a[i] + a[j], i, j));

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

    fout << ans;
    return 0;
}