⊥

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
	int c,n,k,ans=0,a[1919810];
	cin>>n>>c;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort (a+1,a+n+1);
	for(int i=1;i<=n;i++){
		int *j=lower_bound(a+1,a+n+1,a[i]-c);
		if(*j==a[i]-c){
			ans++;
		}
	}
	cout<<ans;
    return 0;
}