#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<vector>
#define N 1000005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,c,a[N],t1[N],t2[N],sum[N*3],now=-1,ans,x;
void ud(int x,int k)
{
	if(!x)x++;
	for(int i=x;i<=n;i+=i&-i)
	{
		t1[i]+=k;
		t2[i]+=(x-1)*k;
	}
}
int gs(int x)
{
	int sum=0;
	for(int i=x;i;i&=i-1)
		sum+=x*t1[i]-t2[i];
	return sum;
}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48&&c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("Triplets.in","r",stdin);freopen("Triplets.out","w",stdout);
	n=read();c=read();
	fo(i,1,n)a[i]=read()*2,sum[a[i]+c]++;
	sort(a+1,a+n+1);
	fo(i,1,n)
	{
		while(now+1<a[i])
		{
			now++;
			if(!sum[now])continue;
			x=lower_bound(a+1,a+n+1,now)-a;
			ud(1,sum[now]);ud(x,-sum[now]);
		}
		x=upper_bound(a+1,a+n+1,a[i]-c)-a;
		ans+=gs(i)-gs(x-1);
	}
	printf("%lld",ans);
	return 0;
}