#include<bits/stdc++.h>
#define LL long long  
using namespace std;
int n,k,hx[100000010],m,ans,c;
int cmp(int x,int y){
	return x>y;
}
int main()
{
	
	cin>>n>>c;
	for(int i=1;i<=n;i++){
		cin>>hx[i];
	}
	sort(hx+1,hx+n+1,cmp);
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			if(hx[i]-hx[j]>c){
				break;
			}
			if(hx[i]-hx[j]==c){
				for(int s=j;;s++){
					if(hx[s]==hx[j]){
						ans++;
					}else{
						break;
					}
				}
				break;
			}
		}
	}
	cout<<ans;
	return 0;	
}