#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k; cin >> n >> k;
vector<int> arr(n);
for(int i = 0; i < n; i++)
cin >> arr[i];
unordered_map<int,int> mp;
int cnt = 0;
for(int i = 0; i < n; i++){
mp[arr[i]]++;
}
for(auto it : mp){
int val = it.first;
int req = val - k;
if(mp.find(req) != mp.end())
cnt++;
}
cout << cnt;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuLGs7IGNpbiA+PiBuID4+IGs7Cgl2ZWN0b3I8aW50PiBhcnIobik7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQoJY2luID4+IGFycltpXTsKCQoJdW5vcmRlcmVkX21hcDxpbnQsaW50PiBtcDsKCWludCBjbnQgPSAwOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJbXBbYXJyW2ldXSsrOwoJfQoJZm9yKGF1dG8gaXQgOiBtcCl7CgkJaW50IHZhbCA9IGl0LmZpcnN0OwoJCWludCByZXEgPSB2YWwgLSBrOwoJCWlmKG1wLmZpbmQocmVxKSAhPSBtcC5lbmQoKSkKCQljbnQrKzsKCX0KCWNvdXQgPDwgY250OwoJcmV0dXJuIDA7Cn0=