#include<bits/stdc++.h>
using namespace std;
long long n,c,a[200100],mmax=INT_MIN,ans;
void dic(long long left,long long sum){
	long long right=n,record,left_move,right_move;
	while(left<=right){
		long long mid=(left+right)/2;
		//cout<<mid<<endl;
		if(a[mid]==sum){
			ans++;
			record=left_move=right_move=mid;
			break;
		}
		if(a[mid]>sum){
			right=mid-1;
		}
		if(a[mid]<sum){
			left=mid+1;
		}
		
	}
	while(a[--left_move]==sum&&(left_move>0))ans++;
	while(a[++right_move]==sum&&(right_move<=n))ans++;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>c;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		mmax=max(mmax,a[i]); 
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		if(a[i]+c<=mmax){
			dic(i,a[i]+c);
		}
		
	}
	cout<<ans<<endl;
	return 0;
}