#include<iostream>
#include<unordered_set>
using namespace std;
unordered_set<int> s;
int main()
{
int n, k, val;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
cin >> val;
s.insert(val);
}
int ans = 0;
for (unordered_set<int>::iterator it = s.begin(); it != s.end(); ++it)
if (s.find(*it + k) != s.end()) ans++;
cout << ans << endl;
return 0;}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHVub3JkZXJlZF9zZXQ+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnVub3JkZXJlZF9zZXQ8aW50PiBzOwppbnQgbWFpbigpCnsKICBpbnQgbiwgaywgdmFsOwogIGNpbiA+PiBuID4+IGs7CiAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspCiAgewogICAgY2luID4+IHZhbDsKICAgIHMuaW5zZXJ0KHZhbCk7CiAgfQogIGludCBhbnMgPSAwOwogIGZvciAodW5vcmRlcmVkX3NldDxpbnQ+OjppdGVyYXRvciBpdCA9IHMuYmVnaW4oKTsgaXQgIT0gcy5lbmQoKTsgKytpdCkKICAgIGlmIChzLmZpbmQoKml0ICsgaykgIT0gcy5lbmQoKSkgYW5zKys7CiAgY291dCA8PCBhbnMgPDwgZW5kbDsKICByZXR1cm4gMDt9