#include <cstdio>
#include <vector>

using namespace std;

#define maxn 1024
#define maxp 204729
#define maxp2 254729

FILE *in = fopen("oite.in", "r"), *out = fopen("oite.out", "w");

struct hash
{
    short i, j;
};

int n;
int L;
int a[maxn];
//vector<hash> h[maxp];

hash h1[maxp][5];
hash h2[maxp2][5];

void hadd(int p, int q)
{
    int t = (a[p] + a[q]) % maxp;
    int d = (a[p] + a[q]) % maxp2;

    if ( h1[t][0].i < h2[d][0].i )
        h1[t][ ++h1[t][0].i ].i = p, h1[t][ h1[t][0].i ].j = q;
    else
        h2[d][ ++h2[d][0].i ].i = p, h2[d][ h2[d][0].i ].j = q;

//    hash tt;
//    tt.i = p;
//    tt.j = q;
//
//    h[t].push_back(tt);
}

int hget(int p, int q)
{
    int v = (L - (a[p] + a[q]));
    if ( v < 0 )
        return 0;

    int s = 0;
    int t = v % maxp;
    int d = v % maxp2;

    for ( int i = 1; i < 5; ++i )
    {
        if ( h1[t][i].i > q && a[h1[t][i].i] + a[h1[t][i].j] == v )
            ++s;

        if ( h2[d][i].i > q && a[h2[d][i].i] + a[h2[d][i].j] == v )
            ++s;
    }
//    for ( vector<hash>::iterator i = h[t].begin(); i != h[t].end(); ++i )
//        if ( i->i > q && a[i->i] + a[i->j] == v )
//            ++s;

    return s;
}

int main()
{
    fscanf(in, "%d %d", &n, &L);

    for ( int i = 0; i < n; ++i )
        fscanf(in, "%d", &a[i]);

    for ( int i = 0; i < n; ++i )
        for ( int j = i+1; j < n; ++j )
            hadd(i, j);

    int cnt = 0;
    for ( int i = 0; i < n; ++i )
        for ( int j = i+1; j < n; ++j )
            cnt += hget(i, j);


    fprintf(out, "%d\n", cnt);

	return 0;
}