#include <bits/stdc++.h>

using namespace std;

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

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

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

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

        if (k < i)
        {
            if (x == val)
                ans++;
        }
        else
            return;
    }

}

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], j));
            if (m - (a[i] + a[j]))
                findHash(m - (a[i] + a[j]), i);
        }


    fout << ans;
    return 0;
}