#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+100;
int a[MAXN];
int find(int l,int r,int key)
{
	int ans=-1;
	while(l<=r)
	{
		int mid=l+(r-l)/2;
		if(a[mid]==key)
		{
			ans=mid;
			return ans;
		}
		else if(a[mid]<key)l=mid+1;
		else r=mid-1;
	}
	return ans;
}
int main()
{
	int n,mb,sum=0;
	cin>>n>>mb;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	for(int i=1;i<n;i++)
	{
		int s=find(i,n,mb+a[i]);
		if(s!=-1)sum++;
	}
	cout<<sum;
	return 0;
}