#include<bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;

int a[N];

int main()
{

    int n,c;

    cin >> n >> c;

    for(int i = 1; i <= n; i++) cin >> a[i];

    int num = 0;

    sort(a+1,a+1+n,greater<int>());

    for(int i = 1,j = i + 1; i < n; i++){
        while(a[i] - a[j] <= c && j <= n){
            if(a[i] - a[j] == c) num++;
            j++;
        }
    }

    cout << num << endl;

    return 0;
}