#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
#define int long long
map<int,int> ma;
int arr[N];
int tmp;
int cnt ;
// 没说是有序的！！！先排序
signed main(){
    int n,m;
    scanf("%lld%lld",&n,&m);
    for(int i=0;i<n;++i){
        scanf("%d",&tmp);
        if(ma.find(tmp)==ma.end()){
            ma[tmp]=1;arr[cnt++] = tmp;
        }else ma[tmp]++;
        
    }
    sort(arr,arr+cnt);
    int j=1;
    int ans = 0;
    //for(int i=0;i<cnt;++i) cout<<arr[i]<<endl;
    for(int i=0;i<cnt;++i){
        
        while(arr[j]-arr[i]<m){
            j++;
        }
        if(arr[j]-arr[i]==m){
            ans += ma[arr[i]]*ma[arr[j]];
        }
        //cout<<i<<" "<<j<<" "<<ans<<endl;
    }
    cout<<ans<<endl;
    return 0;
}