using namespace std;
const int N=2000010;
int a[N],b[N],n,q;

int main()
{
	cin>>n>>q;
	for(int i=1;i<=n;i++) 
	{
		cin>>a[i];
		
	}
	sort(a+1,a+n+1);
	int sum=0;
	for(int i=1;i<=n;i++)
	{
		int g;
		b[i]=a[i]+q;
		int l=1,r=n;
		while(l<r)
		{
			int mid1=l+r>>1;
			if(a[mid1]>=b[i]) r=mid1;
			else l=mid1+1;
		}
		if(a[l]!=b[i]) continue;
		else 
		{
			g=l;
			
			r=n;
			while(l<r)
			{
				int mid2=l+r+1>>1;
				if(a[mid2]<=b[i]) l=mid2;
				else r=mid2-1;
			}
			sum+=l-g+1;
		}
	}
	printf("%d",sum);
	
	return 0;
 } ```