#include<Bits/stdc++.h>
using namespace std;
int n,c;
int s[10005];
int ans;
int _search(int l,int r,int num){
	int mid;
	int a=l,b=r;
	while(a<=b){
		mid=(a+b)>>1;
		if(num==s[mid]){
			return 1;
		}
		if(num>s[mid]){
			a=mid+1;
		}
		if(num<s[mid]){
			b=mid-1;
		}
	}
	return 0;
}

int main(){
	cin>>n>>c;
	for(int i=1;i<=n;i++){
		cin>>s[i];
	}
	sort(s+1,s+n+1);
	for(int i=1;i<=n;i++){//B
		int A=s[i]+c;
		ans+=_search(1,n,A);
	}
	cout<<ans;
}

救命啊，为啥CE了