#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream f ("oite.in");
ofstream g ("oite.out");

const int MOD = 666013;
const int NMAX = 1024 + 1;

int n, lana;
int oaie[NMAX];
vector < pair <int, int> > sol[MOD];

void citeste() {
    f >> n >> lana;
    for (int i = 1; i <= n; i++) f >> oaie[i];
}

void adauga(int numar) {
    int x = numar % MOD;
    int l = sol[x].size();
    for (int i = 0; i < l; i++)
        if (sol[x][i].first == numar) {
            sol[x][i].second++;
            return;
        }
    sol[x].push_back(make_pair(numar, 1));
}

int aparitii(int numar) {
    int x = numar % MOD;
    int l = sol[x].size();
    for (int i = 0; i < l; i++)
        if (sol[x][i].first == numar) {
            return sol[x][i].second;
        }
    return 0;
}

void rezolva() {
    long long s, rez = 0;
    for (int i = 1; i < n; i++) {
        for (int j = i + 1; j <= n; j++) {
            s = 1LL * oaie[i] + 1LL * oaie[j];
            if (s > lana) continue;
            rez = rez + aparitii(lana - s);
        }

        for (int j = 1; j < i; j++) {
            s = 1LL * oaie[i] + 1LL * oaie[j];
            if (s > lana) continue;
            adauga(s);
        }
    }

    g << rez << '\n';
}

int main() {
    citeste();
    rezolva();
    return 0;
}