#include <stdio.h>

#define nmax 1024
#define mod1 1000003
#define mod2 2000003

int H1[mod1], H2[mod2], A[nmax], N, S, ans, L, i, j;

void read()
{
	freopen("oite.in", "r", stdin);
	scanf("%d%d", &N, &L);
	for (i = 1; i <= N; ++i)
		scanf("%d", &A[i]);
}

void solve()
{
	++H1[(A[N-1]+A[N]) % mod1];
	++H2[(A[N-1]+A[N]) % mod2];

	for (i = N-2; i > 1; i--)
	{
		for (j = i-1; j >= 1; j--)
		{
			S = A[i] + A[j];

			ans += H1[(L%mod1-S%mod1+mod1)%mod1] < H2[(L%mod2-S%mod2+mod2)%mod2]?
						H1[(L%mod1-S%mod1+mod1)%mod1]: H2[(L%mod2-S%mod2+mod2)%mod2];
		}
		for (j = i+1; j <= N; ++j)
		{
			++H1[(A[i] + A[j]) % mod1];
			++H2[(A[i] + A[j]) % mod2];
		}
	}
}

void write()
{
	freopen("oite.out", "w", stdout);
	printf("%d\n", ans);
}

int main()
{
	read();

	solve();

	write();

	return 0;
}