#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
int n,m;
int a[200005];
int ans;
bool check(int mid,int x){
	if(a[mid]<=x) return 1;
	return 0;
}
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		int x=m+a[i];
		int l=1,r=n,mid;
		while(l<=r){
			mid=(l+r)>>1;
			if(check(mid,x)) l=mid+1;
			else r=mid-1;
		}	
		if(a[l-1]-a[i]==m) ans++;
		//cout<<l<<endl;
	}
	cout<<ans;
	return 0;
}