#include<iostream>
#include<algorithm>
using namespace std;
long long n,c,a[200005];
int main(){
	ios::sync_with_stdio(false); 
	cin.tie(0),cout.tie(0);
	cin >> n >> c;
	for(long long i = 1;i<=n;i++) cin >> a[i];
	sort(a+1,a+1+n);
	int cnt = 0;
	for(long long l = 1,r = 1;r<=n&&l<=n&&l<=r;r++){
		while(a[r]-a[l] >= c){
			if(a[r]-a[l] == c){
				cnt++;
			}
			l++;
		}
	}
	cout << cnt;
	return 0;
}

记录