#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int s[200050];
int main()
{
	int n, c;
	long long sum = 0;
	cin >> n >> c;
	for (int i = 0; i < n; i++)
		cin >> s[i];
	sort(s, s + n);
	int i=n-1;
	while (i>=1)
	{
		int ss = s[i] - c;
		int uk = lower_bound(s, s + n, s[i]) - s;
		int uk1 = upper_bound(s, s + n, s[i]) - s;
		int k = lower_bound(s, s + n, ss) - s;
		int k1 = upper_bound(s, s + n, ss) - s;
		if (s[k] == ss )
			sum += (k1 - k)*(uk1-uk);
		i -= (uk1 - uk);
	}
	cout << sum;
	return 0;
}```